Wrappers for feature subset selection
Artificial Intelligence - Special issue on relevance
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
On the algorithmic implementation of multiclass kernel-based vector machines
The Journal of Machine Learning Research
An introduction to variable and feature selection
The Journal of Machine Learning Research
Dimensionality reduction via sparse support vector machines
The Journal of Machine Learning Research
Efficiently Mining Gene Expression Data via a Novel Parameterless Clustering Method
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
MILES: Multiple-Instance Learning via Embedded Instance Selection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Boosting with structural sparsity
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Learning to rank using 1-norm regularization and convex hull reduction
Proceedings of the 48th Annual Southeast Regional Conference
A comparison of methods for multiclass support vector machines
IEEE Transactions on Neural Networks
Hi-index | 0.01 |
Novel biomarkers can be discovered through mining high dimensional microarray datasets using machine learning techniques. Here we propose a novel recursive gene selection method which can handle the multiclass setting effectively and efficiently. The selection is performed iteratively. In each iteration, a linear multiclass classifier is trained using 1-norm regularization, which leads to sparse weight vectors, i.e., many feature weights are exactly zero. Those zero-weight features are eliminated in the next iteration. The empirical results demonstrate that the selected features (genes) have very competitive discriminative power. In addition, the selection process has fast rate of convergence.