Noorhaniza Wahid
Universiti Tun Hussein Onn Malaysia

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Flatten-T Swish: a thresholded ReLU-Swish-like activation function for deep learning Hock Hung Chieng; Noorhaniza Wahid; Ong Pauline; Sai Raj Kishore Perla
International Journal of Advances in Intelligent Informatics Vol 4, No 2 (2018): July 2018
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v4i2.249

Abstract

Activation functions are essential for deep learning methods to learn and perform complex tasks such as image classification. Rectified Linear Unit (ReLU) has been widely used and become the default activation function across the deep learning community since 2012. Although ReLU has been popular, however, the hard zero property of the ReLU has heavily hindering the negative values from propagating through the network. Consequently, the deep neural network has not been benefited from the negative representations. In this work, an activation function called Flatten-T Swish (FTS) that leverage the benefit of the negative values is proposed. To verify its performance, this study evaluates FTS with ReLU and several recent activation functions. Each activation function is trained using MNIST dataset on five different deep fully connected neural networks (DFNNs) with depth vary from five to eight layers. For a fair evaluation, all DFNNs are using the same configuration settings. Based on the experimental results, FTS with a threshold value, T=-0.20 has the best overall performance. As compared with ReLU, FTS (T=-0.20) improves MNIST classification accuracy by 0.13%, 0.70%, 0.67%, 1.07% and 1.15% on wider 5 layers, slimmer 5 layers, 6 layers, 7 layers and 8 layers DFNNs respectively. Apart from this, the study also noticed that FTS converges twice as fast as ReLU. Although there are other existing activation functions are also evaluated, this study elects ReLU as the baseline activation function.
Bat algorithm and k-means techniques for classification performance improvement Rozlini Mohamed; Munirah Mohd Yusof; Noorhaniza Wahid; Norhanifah Murli; Muhaini Othman
Indonesian Journal of Electrical Engineering and Computer Science Vol 15, No 3: September 2019
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v15.i3.pp1411-1418

Abstract

This paper presents Bat Algorithm and K-Means techniques for classification performance improvement. The objective of this study is to investigate efficiency of Bat Algorithm in discrete dataset and to find the optimum feature in discrete dataset. In this study, one technique that comprise the discretization technique and feature selection technique have been proposed. Our contribution is in two process of classification: pre-processing and feature selection process. First, to proposed discretization techniques called as BkMD, where we hybrid Bat Algorithm technique and K-Means classifier. Second, to proposed BkMDFS as feature selection technique where Bat Algorithm is embed into BkMD. In order to evaluate our proposed techniques, 14 continuous dataset from various applications are used in experiment. From the experiment, results show that BkMDFS outperforms in most performance measures. Hence it shows that, Bat Algorithm have potential to be one of the discretization technique and feature selection technique.