title: The Fisher-Markov selector: fast selecting maximally separable feature subset for multiclass classification with applications to high-dimensional data.
abstract: Selecting features for multiclass classification is a critically important task for pattern recognition and machine learning applications. Especially challenging is selecting an optimal subset of features from high-dimensional data, which typically have many more variables than observations and contain significant noise, missing components, or outliers. Existing methods either cannot handle high-dimensional data efficiently or scalably, or can only obtain local optimum instead of global optimum. Toward the selection of the globally optimal subset of features efficiently, we introduce a new selector--which we call the Fisher-Markov selector--to identify those features that are the most useful in describing essential differences among the possible groups. In particular, in this paper we present a way to represent essential discriminating characteristics together with the sparsity as an optimization objective. With properly identified measures for the sparseness and discriminativeness in possibly high-dimensional settings, we take a systematic approach for optimizing the measures to choose the best feature subset. We use Markov random field optimization techniques to solve the formulated objective functions for simultaneous feature selection. Our results are noncombinatorial, and they can achieve the exact global optimum of the objective function for some special kernels. The method is fast; in particular, it can be linear in the number of features and quadratic in the number of observations. We apply our procedure to a variety of real-world data, including mid--dimensional optical handwritten digit data set and high-dimensional microarray gene expression data sets. The effectiveness of our method is confirmed by experimental results. In pattern recognition and from a model selection viewpoint, our procedure says that it is possible to select the most discriminating subset of variables by solving a very simple unconstrained objective function which in fact can be obtained with an explicit expression.
authors.affiliation: Department of Computer Science, Faner Hall, Mailcode 4511, Southern Illinois University Carbondale, 1000 Faner Drive, Carbondale, IL 62901, USA. qcheng@cs.siu.edu
authors.forename: Qiang
authors.initials: Q
authors.lastname: Cheng
authors.forename: Hongbo
authors.initials: H
authors.lastname: Zhou
authors.forename: Jie
authors.initials: J
authors.lastname: Cheng
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D016002:Discriminant Analysis; D005260:Female; D006801:Humans; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D021621:Imaging, Three-Dimensional / Q000145:classification; D007938:Leukemia / Q000175:diagnosis; D008175:Lung Neoplasms / Q000175:diagnosis; D008297:Male; D008390:Markov Chains; D015999:Multivariate Analysis; D010363:Pattern Recognition, Automated / Q000379:methods*; D011471:Prostatic Neoplasms / Q000175:diagnosis; D012984:Software