An eigenvalue-problem formulation for non-parametric mutual information maximisation for linear dimensionality reduction

Proceedings of the 2012 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2012

Volumn 2, Issue , 2012, Pages 905-910

  Liu, Raymond ^a   Gillies, Duncan F ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Dimensionality reduction; Eigenvalue problem; Feature extraction; Mutual information; Pattern recognition

Indexed keywords

CLASSIFICATION RESULTS; COMPUTATION TIME; DATA SETS; DIMENSIONALITY REDUCTION; EIGENVALUE-PROBLEM; INPUT DATAS; ITERATIVE ALGORITHM; LINEAR DIMENSIONALITY REDUCTION; LINEAR DISCRIMINANT ANALYSIS; LOCAL OPTIMA; MUTUAL INFORMATIONS; NON-PARAMETRIC;

ALGORITHMS; CLASSIFICATION (OF INFORMATION); COMPUTER VISION; FACE RECOGNITION; FEATURE EXTRACTION; ITERATIVE METHODS; PATTERN RECOGNITION; PRINCIPAL COMPONENT ANALYSIS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 84873306139     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. C. M. Bishop, Pattern Recognition and Machine Learning. Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2006.
2. J. Yang and J.-y. Yang, "Why can LDA be performed in PCA transformed space?" Pattern Recognition, vol. 36, no. 2, pp. 563-566, Feb. 2003.
3. K. Torkkola, "Feature extraction by non parametric mutual information maximization," J. Mach. Learn. Res., vol. 3, pp. 1415-1438, Mar. 2003. [Online]. Available: http://dl.acm.org/citation.cfm?id=944919.944981
4. X. Qiu and L. Wu, "Info-margin maximization for feature extraction," Pattern Recognition Letters, vol. 30, no. 16, pp. 1516-1522, 2009. [Online]. Available: http://www.sciencedirect.com/science/article/pii/ S0167865509002141
5. S.-H. Yang, H. Zha, S. Zhou, and B.-G. Hu, "Variational graph embedding for globally and locally consistent feature extraction," in Machine Learning and Knowledge Discovery in Databases, ser. Lecture Notes in Computer Science. Springer Berlin / Heidelberg, 2009.
6. K. Bollacker and J. Ghosh, "Linear feature extractors based on mutual information," in Pattern Recognition, 1996., Proceedings of the 13th International Conference on, vol. 2, aug 1996, pp. 720-724 vol.2.
7. A. Renyi, "On measures of entropy and information," vol. 1. University of California Press, 1961, pp. 547-561.
8. I. Guyon and A. Elisseeff, "An introduction to vari able and feature selection," J. Mach. Learn. Res., vol. 3, pp. 1157-1182, March 2003. [Online]. Available: http://portal.acm.org/citation.cfm?id=944919.944968
9. H. Peng, F. Long, and C. Ding, "Feature selection based on mutual information: Criteria of max-dependency, max-relevance, and min-redundancy, " IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, pp. 1226-1238, 2005.
10. E. Parzen, "On estimation of a probability density function and mode," The Annals of Mathematical Statistics, vol. 33, no. 3, pp. pp. 1065-1076, 1962. [Online]. Available: http://www.jstor.org/stable/2237880
11. B. W. Silverman, Density estimation for statistics and data analysis. Chapman and Hall, 1998.
12. A. Martinez and A. Kak, "Pca versus lda," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 23, no. 2, pp. 228-233, feb 2001.