scholarly journals A Feature Selection Algorithm Based on Qualitative Mutual Information for Cancer Microarray Data

2018 ◽  
Vol 132 ◽  
pp. 244-252 ◽  
Author(s):  
Arpita Nagpal ◽  
Vijendra Singh
2016 ◽  
Vol 10 (1) ◽  
pp. 278-286 ◽  
Author(s):  
Wang Zhongxin ◽  
Sun Gang ◽  
Zhang Jing ◽  
Zhao Jia

With the development of microarray technology, massive microarray data is produced by gene expression experiments, and it provides a new approach for the study of human disease. Due to the characteristics of high dimensionality, much noise and data redundancy for microarray data, it is difficult to my knowledge from microarray data profoundly and accurately,and it also brings enormous difficulty for information genes selection. Therefore, a new feature selection algorithm for high dimensional microarray data is proposed in this paper, which mainly involves two steps. In the first step, mutual information method is used to calculate all genes, and according to the mutual information value, information genes is selected as candidate genes subset and irrelevant genes are filtered. In the second step, an improved method based on Lasso is used to select information genes from candidate genes subset, which aims to remove the redundant genes. Experimental results show that the proposed algorithm can select fewer genes, and it has better classification ability, stable performance and strong generalization ability. It is an effective genes feature selection algorithm.


2013 ◽  
Vol 22 (04) ◽  
pp. 1350027
Author(s):  
JAGANATHAN PALANICHAMY ◽  
KUPPUCHAMY RAMASAMY

Feature selection is essential in data mining and pattern recognition, especially for database classification. During past years, several feature selection algorithms have been proposed to measure the relevance of various features to each class. A suitable feature selection algorithm normally maximizes the relevancy and minimizes the redundancy of the selected features. The mutual information measure can successfully estimate the dependency of features on the entire sampling space, but it cannot exactly represent the redundancies among features. In this paper, a novel feature selection algorithm is proposed based on maximum relevance and minimum redundancy criterion. The mutual information is used to measure the relevancy of each feature with class variable and calculate the redundancy by utilizing the relationship between candidate features, selected features and class variables. The effectiveness is tested with ten benchmarked datasets available in UCI Machine Learning Repository. The experimental results show better performance when compared with some existing algorithms.


2018 ◽  
Vol 76 (5) ◽  
pp. 3494-3526
Author(s):  
Yuefeng Zheng ◽  
Ying Li ◽  
Gang Wang ◽  
Yupeng Chen ◽  
Qian Xu ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document