A new kernelization framework for Mahalanobis distance learning algorithms

Neurocomputing

Volumn 73, Issue 10-12, 2010, Pages 1570-1579

  Chatpatanasiri, Ratthachat ^a   Korsrilabutr, Teesid ^a   Tangchanachaianan, Pasakorn ^a   Kijsirikul, Boonserm ^a  

^a CHULALONGKORN UNIVERSITY   (Thailand)

Author keywords

Dimensionality reduction; Distance metric learning; Kernel alignment; Kernel machines; Representer theorem

Indexed keywords

BRUTE FORCE; DATA SETS; DIMENSIONALITY REDUCTION; DISTANCE METRIC LEARNING; INFINITE DIMENSIONAL; KERNEL MACHINE; KERNEL TRICK; KERNELIZATION; MAHALANOBIS DISTANCES; MATHEMATICAL FORMULAS; REPRESENTER THEOREM; SPEED-UPS;

ALIGNMENT; DISTANCE EDUCATION;

LEARNING ALGORITHMS;

ACCURACY; ALGORITHM; ARTICLE; CALCULATION; DATA BASE; K NEAREST NEIGHBOR; KERNEL METHOD; LEARNING; PRINCIPAL COMPONENT ANALYSIS; PRIORITY JOURNAL; VALIDITY;

EID: 77952550960     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2009.11.037     Document Type: Article

References (37)

1. A. Asuncion, D.J. Newman, UCI machine learning repository, 2007.
2. Bach F., Jordan M. Learning spectral clustering, with application to speech separation. Journal of Machine Learning Research 2006, 7:1963-2001.
3. S. Boyd, L. Vandenberghe, Convex Optimization, 2004.
4. O. Chapelle, B. Schölkopf, Incorporating invariances in nonlinear SVMs, in: NIPS, 2001.
5. Semi-supervised Learning 2006, The MIT Press, Cambridge, MA. O. Chapelle, B. Schölkopf, A. Zien (Eds.).
6. R. Chatpatanasiri, T. Korsrilabutr, P. Tangchanachaianan, B. Kijsirikul, On kernelizing Mahalanobis distance learning algorithms, 2008. Arxiv preprint. http://arxiv.org/abs/0804.1441.
7. H.T. Chen, H.W. Chang, T.L. Liu, Local discriminant embedding and its variants, in: CVPR, vol. 2, 2005.
8. Demmel J.W. Applied Numerical Linear Algebra 1997, SIAM, Philadelphia, PA.
9. A. Globerson, S. Roweis, Metric learning by collapsing classes, in: NIPS, 2006.
10. J. Goldberger, S. Roweis, G. Hinton, R. Salakhutdinov, Neighbourhood components analysis, in: NIPS, 2005.
11. Y. Guermeur, A. Lifchitz, R. Vert, A kernel for protein secondary structure prediction, in: Kernel Methods in Computational Biology, 2004.
12. P. Jain, B. Kulis, J. Davis, I. Dhillon, Metric and kernel learning using a linear transformation, 2009. Arxiv preprint: arXiv:0910.5932.
13. Kimeldorf G., Wahba G. Some results on Tchebycheffian spline functions. Journal of Mathematical Analysis and Applications 1971, 33:82-95.
14. Lanckriet G.R.G., Cristianini N., Bartlett P., Ghaoui L.E., Jordan M.I. Learning the kernel matrix with semidefinite programming. Journal of Machine Learning Research 2004, 5:27-72.
15. W. Lewkeeratiyutkul, Lecture Notes on Real Analysis I-II, 2006. http://pioneer.netserv.chula.ac.th/~lwicharn/2301622/.
16. Li J., Li X., Tao D. KPCA for semantic object extraction in images. Pattern Recognition 2008, 41:3244-3250.
17. Li X., Lin S., Yan S., Xu D. Discriminant locally linear embedding with high-order tensor data. Systems Man and Cybernetics-Part B 2008, 38:342-352.
18. A. Ng, A. Zheng, M. Jordan, Link analysis, eigenvectors and stability, in: IJCAI, 2001, pp. 903-910.
19. V. Pan, G. Qian, A. Zheng, Preconditioning, randomization, solving linear systems, eigen-solving, and root-finding, in: The 2009 Conference on Symbolic Numeric Computation, ACM, New York, NY, 2009.
20. Pang Y., Liu Z., Yu N. A new nonlinear feature extraction method for face recognition. Neurocomputing 2006, 69(7-9):949-953.
21. Y. Pang, L. Wang, Y. Yuan, Generalized KPCA by Adaptive Rules in Feature Space, International Journal of Computer Mathematics (2009). DOI:. http://10.1080/00207160802044118.
22. Pang Y., Yuan Y., Li X. Effective feature extraction in high-dimensional space. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 2008, 38(6):1652-1656.
23. B. Schölkopf, R. Herbrich, A.J. Smola, A generalized representer theorem, in: COLT, 2001.
24. B. Schölkopf, A.J. Smola, Learning with kernels, 2001.
25. M. Sugiyama, Local fisher discriminant analysis for supervised dimensionality reduction, in: ICML, 2006.
26. L. Torresani, K. Lee, Large margin components analysis, in: NIPS, 2007.
27. K. Weinberger, J. Blitzer, L. Saul, Distance metric learning for large margin nearest neighbor classification, in: NIPS, 2006.
28. E.P. Xing, A.Y. Ng, M.I. Jordan, S. Russell, Distance metric learning with application to clustering with side-information, in: NIPS, 2003.
29. Yan S., Xu D., Zhang B., Zhang H.-J., Yang Q., Lin S. Graph embedding and extensions: a general framework for dimensionality reduction. Pattern Analysis and Machine Intelligence 2007, 29(1).
30. Yang J., Yang J.Y. Why can LDA be performed in PCA transformed space?. Pattern Recognition 2003, 36:563-566.
31. L. Yang, R. Jin, R. Sukthankar, Y. Liu, An efficient algorithm for local distance metric learning, in: AAAI, 2006.
32. Yu H., Yang J. A direct LDA algorithm for high-dimensional data-with application to face recognition. Pattern Recognition 2001, 34:2067-2070.
33. Zhang C., Nie F., Xiang S. A general kernelization framework for learning algorithms based on kernel PCA. Neurocomputing 2009, 73:959-967.
34. Zhang T., Li X., Tao D., Yang J. Local coordinates alignment (LCA): a novel manifold learning approach. International Journal of Pattern Recognition and Artificial Intelligence 2008, 22(4):667-690.
35. Zhang T., Li X., Tao D., Yang J. Patch alignment for dimensionality reduction. IEEE Transactions on Knowledge and Data Engineering 2009, 21(9):1299-1313.
36. W. Zhang, X. Xue, Z. Sun, Y.-F. Guo, H. Lu, Optimal dimensionality of metric space for classification, in: ICML, 2007.
37. X. Zhu, J. Kandola, Z. Ghahramani, J. Lafferty, Nonparametric transforms of graph kernels for semi-supervised learning, in: NIPS, 2005.