title: Maximization of mutual information for supervised linear feature extraction.
abstract: In this paper, we present a novel scheme for linear feature extraction in classification. The method is based on the maximization of the mutual information (MI) between the features extracted and the classes. The sum of the MI corresponding to each of the features is taken as an heuristic that approximates the MI of the whole output vector. Then, a component-by-component gradient-ascent method is proposed for the maximization of the MI, similar to the gradient-based entropy optimization used in independent component analysis (ICA). The simulation results show that not only is the method competitive when compared to existing supervised feature extraction methods in all cases studied, but it also remarkably outperform them when the data are characterized by strongly nonlinear boundaries between classes.
authors.affiliation: Department of Signal Theory and Communications, Universidad Carlos III, Madrid 28911, Spain. leiva@ieee.org
authors.forename: Jose Miguel
authors.initials: JM
authors.lastname: Leiva-Murillo
authors.forename: Antonio
authors.initials: A
authors.lastname: Artés-Rodríguez
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D016247:Information Storage and Retrieval / Q000379:methods*; D016014:Linear Models; D010363:Pattern Recognition, Automated / Q000379:methods*; D015203:Reproducibility of Results; D012680:Sensitivity and Specificity