Abstract

We report on the successful application of feature selection methods to a classification problem in molecular biology involving only 72 data points in a 7130 dimensional space. Our approach is a hybrid of filter and wrapper approaches to feature selection. We make use of a sequence of simple filters, culminating in Koller and Sahami's (1996) Markov Blanket filter, to decide on particular feature subsets for each subset cardinality. We compare between the resulting subset cardinalities using cross validation. The paper also investigates regularization methods as an alternative to feature selection, showing that feature selection methods are preferable in this problem.

Keywords

Feature selectionMarkov blanketCardinality (data modeling)Computer scienceFilter (signal processing)Feature (linguistics)Pattern recognition (psychology)Regularization (linguistics)Feature vectorData miningMarkov chainMinimum redundancy feature selectionArtificial intelligenceSelection (genetic algorithm)AlgorithmMachine learningMarkov modelVariable-order Markov model

Affiliated Institutions

Related Publications

Publication Info

Year
2001
Type
article
Pages
601-608
Citations
628
Access
Closed

External Links

Citation Metrics

628
OpenAlex

Cite This

Eric P. Xing, Michael I. Jordan, Richard M. Karp (2001). Feature selection for high-dimensional genomic microarray data. , 601-608.