A Gaussian Mixture based maximization of mutual information for supervised feature extraction

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a new method for linear feature extraction and dimensionality reduction for classification problems. The method is based on the maximization of the Mutual Information (MI) between the resulting features and the classes. A Gaussian Mixture is used for modelling the distribution of the data. By means of this model, the entropy of the data is then estimated, and so the MI at the output. A gradient descent algorithm is provided for its optimization. Some experiments are provided in which the method is compared with other popular linear feature extractors. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Leiva-Murillo, J. M., & Artés-Rodríguez, A. (2004). A Gaussian Mixture based maximization of mutual information for supervised feature extraction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3195, 271–278. https://doi.org/10.1007/978-3-540-30110-3_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free