Improved Boosting Algorithms Using Confidence-rated Predictions
Machine Learning - The Eleventh Annual Conference on computational Learning Theory
Gene selection using a two-level hierarchical Bayesian model
Bioinformatics
A Blocking Strategy to Improve Gene Selection for Classification of Gene Expression Data
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Markov blanket-embedded genetic algorithm for gene selection
Pattern Recognition
Development of Two-Stage SVM-RFE Gene Selection Strategy for Microarray Expression Data Analysis
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Evolutionary Rough Feature Selection in Gene Expression Data
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Filter versus wrapper gene selection approaches in DNA microarray domains
Artificial Intelligence in Medicine
International Journal of Approximate Reasoning
Hi-index | 0.01 |
Gene selection is one of the important issues for cancer classification based on gene expression profiles. Filter and wrapper approaches are widely used for gene selection, where the former is hard to measure the relationship between genes and the latter requires lots of computation. We present a novel method, called gene boosting, to select relevant gene subsets by integrating filter and wrapper approaches. It repeatedly selects a set of top-ranked informative genes by a filtering algorithm with respect to a temporal training dataset constructed according to the classification result for the original training dataset. Empirical results on three microarray benchmark datasets have shown that the proposed method is effective and efficient in finding a relevant and concise gene subset. It achieved competitive performance with fewer genes in a reasonable time, as well as led to the identification of some genes frequently getting selected.