Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms

New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particularly suitable to the classification of microarray expression data, where the goal is to obtain accurate rules depending on few genes only. Our algorithms are fast and easy to implement, since they center on an incremental (large margin) algorithm which allows us to avoid linear, quadratic or higher-order programming methods. We report on preliminary experiments with five known DNA microarray datasets. These experiments suggest that multiplicative large margin algorithms tend to outperform additive algorithms (such as SVM) on feature selection tasks.

• Type: Conference
• Year: 2003
• Where: NIPS
• Authors: Claudio Gentile
• Keywords: Algorithms, Feature Selection Algorithms, Large Margin, NIPS 2003, NIPS 2007