scholarly journals A review of Harmony Search algorithm-based feature selection method for classification

2019 ◽  
Vol 1192 ◽  
pp. 012038 ◽  
Author(s):  
N Yusup ◽  
A M Zain ◽  
A A Latib
Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 570
Author(s):  
Jin Hee Bae ◽  
Minwoo Kim ◽  
J.S. Lim ◽  
Zong Woo Geem

This paper proposes a feature selection method that is effective in distinguishing colorectal cancer patients from normal individuals using K-means clustering and the modified harmony search algorithm. As the genetic cause of colorectal cancer originates from mutations in genes, it is important to classify the presence or absence of colorectal cancer through gene information. The proposed methodology consists of four steps. First, the original data are Z-normalized by data preprocessing. Candidate genes are then selected using the Fisher score. Next, one representative gene is selected from each cluster after candidate genes are clustered using K-means clustering. Finally, feature selection is carried out using the modified harmony search algorithm. The gene combination created by feature selection is then applied to the classification model and verified using 5-fold cross-validation. The proposed model obtained a classification accuracy of up to 94.36%. Furthermore, on comparing the proposed method with other methods, we prove that the proposed method performs well in classifying colorectal cancer. Moreover, we believe that the proposed model can be applied not only to colorectal cancer but also to other gene-related diseases.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 182868-182887 ◽  
Author(s):  
Samarpan Guha ◽  
Aankit Das ◽  
Pawan Kumar Singh ◽  
Ali Ahmadian ◽  
Norazak Senu ◽  
...  

2021 ◽  
Vol 2021 ◽  
pp. 1-19
Author(s):  
Le Wang ◽  
Yuelin Gao ◽  
Jiahang Li ◽  
Xiaofeng Wang

Feature selection is an essential step in the preprocessing of data in pattern recognition and data mining. Nowadays, the feature selection problem as an optimization problem can be solved with nature-inspired algorithm. In this paper, we propose an efficient feature selection method based on the cuckoo search algorithm called CBCSEM. The proposed method avoids the premature convergence of traditional methods and the tendency to fall into local optima, and this efficient method is attributed to three aspects. Firstly, the chaotic map increases the diversity of the initialization of the algorithm and lays the foundation for its convergence. Then, the proposed two-population elite preservation strategy can find the attractive one of each generation and preserve it. Finally, Lévy flight is developed to update the position of a cuckoo, and the proposed uniform mutation strategy avoids the trouble that the search space is too large for the convergence of the algorithm due to Lévy flight and improves the algorithm exploitation ability. The experimental results on several real UCI datasets show that the proposed method is competitive in comparison with other feature selection algorithms.


2016 ◽  
Vol 89 ◽  
pp. 395-403 ◽  
Author(s):  
Supratim Das ◽  
Pawan Kumar Singh ◽  
Showmik Bhowmik ◽  
Ram Sarkar ◽  
Mita Nasipuri

Author(s):  
Laith Mohammad Abualigah ◽  
Mofleh Al‐diabat ◽  
Mohammad Al Shinwan ◽  
Khaldoon Dhou ◽  
Bisan Alsalibi ◽  
...  

2020 ◽  
Vol 10 (8) ◽  
pp. 2816 ◽  
Author(s):  
Soumyajit Saha ◽  
Manosij Ghosh ◽  
Soulib Ghosh ◽  
Shibaprasad Sen ◽  
Pawan Kumar Singh ◽  
...  

Nowadays, researchers aim to enhance man-to-machine interactions by making advancements in several domains. Facial emotion recognition (FER) is one such domain in which researchers have made significant progresses. Features for FER can be extracted using several popular methods. However, there may be some redundant/irrelevant features in feature sets. In order to remove those redundant/irrelevant features that do not have any significant impact on classification process, we propose a feature selection (FS) technique called the supervised filter harmony search algorithm (SFHSA) based on cosine similarity and minimal-redundancy maximal-relevance (mRMR). Cosine similarity aims to remove similar features from feature vectors, whereas mRMR was used to determine the feasibility of the optimal feature subsets using Pearson’s correlation coefficient (PCC), which favors the features that have lower correlation values with other features—as well as higher correlation values with the facial expression classes. The algorithm was evaluated on two benchmark FER datasets, namely the Radboud faces database (RaFD) and the Japanese female facial expression (JAFFE). Five different state-of-the-art feature descriptors including uniform local binary pattern (uLBP), horizontal–vertical neighborhood local binary pattern (hvnLBP), Gabor filters, histogram of oriented gradients (HOG) and pyramidal HOG (PHOG) were considered for FS. Obtained results signify that our technique effectively optimized the feature vectors and made notable improvements in overall classification accuracy.


Sign in / Sign up

Export Citation Format

Share Document