Elements of information theory
Elements of information theory
Wrappers for feature subset selection
Artificial Intelligence - Special issue on relevance
Data mining: concepts and techniques
Data mining: concepts and techniques
Input Feature Selection by Mutual Information Based on Parzen Window
IEEE Transactions on Pattern Analysis and Machine Intelligence
An introduction to variable and feature selection
The Journal of Machine Learning Research
Fast Binary Feature Selection with Conditional Mutual Information
The Journal of Machine Learning Research
LS Bound based gene selection for DNA microarray data
Bioinformatics
Random subspace method for multivariate feature selection
Pattern Recognition Letters
Input feature selection for classification problems
IEEE Transactions on Neural Networks
Estimating optimal feature subsets using efficient estimation of high-dimensional mutual information
IEEE Transactions on Neural Networks
A new combined filter-wrapper framework for gene subset selection with specialized genetic operators
MCPR'10 Proceedings of the 2nd Mexican conference on Pattern recognition: Advances in pattern recognition
A modified two-stage SVM-RFE model for cancer classification using microarray data
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part I
Gene selection and PSO-BP classifier encoding a prior information
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Feature evaluation and selection with cooperative game theory
Pattern Recognition
A novel forward gene selection algorithm for microarray data
Neurocomputing
Hi-index | 0.01 |
Gene selection, a significant preprocessing of the discriminant analysis of microarray data, is to select the most informative genes from the whole gene set. In this paper, an efficient mutual information-based gene selection algorithm (MIGS) is proposed, in which genes are sequentially forward selected according to an approximate measure of the mutual information between the class and the selected genes. In order to improve the efficiency of the MIGS, an effective pruning strategy is introduced in the selection procedure as well as the employment of Parzen window density estimation technique. Extensive experiments are conducted on three public gene expression datasets and the experimental results confirm the efficiency and effectiveness of the algorithm. Though the computational cost of MIGS-Pruning increases with the number of selected genes, it still has good performance applied in the microarray problems.