Maximization of Mutual Information for Supervised Linear Feature Extraction

Authors:
J. M. Leiva-Murillo;A. Artes-Rodriguez
Affiliations:
Univ. Carlos III, Madrid;-
Venue:
IEEE Transactions on Neural Networks
Year:
2007

Citing 0
Cited 10

A minimax mutual information scheme for supervised feature extraction and its application to EEG-based brain-computer interfacing

EURASIP Journal on Advances in Signal Processing
An information-theoretic approach to feature extraction in competitive learning

Neurocomputing
P300 detection based on feature extraction in on-line brain-computer interface

KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Information-theoretic enhancement learning and its application to visualization of self-organizing maps

Neurocomputing
Comparison of classification methods for P300 brain-computer interface on disabled subjects

Computational Intelligence and Neuroscience - Special issue on Selected Papers from the 4th International Conference on Bioinspired Systems and Cognitive Signal Processing
Brain-computer interface research at Katholieke Universiteit Leuven

Proceedings of the 4th International Symposium on Applied Sciences in Biomedical and Communication Technologies
Dimensionality reduction based on non-parametric mutual information

Neurocomputing
Efficient penetration depth approximation using active learning

ACM Transactions on Graphics (TOG)
Improving the performance of P300-based brain-computer interface through subspace-based filtering

Neurocomputing
Optimized dissimilarity space embedding for labeled graphs

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.