Stable local dimensionality reduction approaches

Pattern Recognition

Volumn 42, Issue 9, 2009, Pages 2054-2066

  Hou, Chenping ^a,b   Zhang, Changshui ^b   Wu, Yi ^a   Jiao, Yuanyuan ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b TSINGHUA NATIONAL LABORATORY FOR INFORMATION SCIENCE AND TECHNOLOGY   (China)

Author keywords

Dimensionality reduction; Laplacian eigenmaps; Local tangent space alignment; Locally linear embedding; Manifold learning

Indexed keywords

DIMENSIONALITY REDUCTION; LAPLACIAN EIGENMAPS; LOCAL TANGENT SPACE ALIGNMENT; LOCALLY LINEAR EMBEDDING; MANIFOLD LEARNING;

EDUCATION; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS;

ALIGNMENT;

EID: 67349170432     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2008.12.009     Document Type: Article

References (27)

1. de Silva V., and Tenenbaum J.B. Global versus local methods in nonlinear dimensionality reduction. In: Becker S., Thrun S., and Obermayer K. (Eds). Proceedings of NIPS vol. 15 (2003) 721-728
2. M. Collins, S. Dasgupta, R. Schapire, A generalization of principal component analysis to the exponential family, in: NIPS 13, 2001.
3. Cox T.F., and Cox M.A.A. Multidimensional Scaling (1994), Chapman & Hall, London
4. Tenenbaum J.B., de Silva V., and Langford J.C. A global geometric framework for nonlinear dimensionality reduction. Science 290 (2000) 2319-2323
5. Weinberger K.Q., and Saul L.K. Unsupervised learning of image manifolds by semidefinite programming. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR-04).2 (2004) 988-995
6. Weinberger K.Q., Packer B.D., and Saul L.K. Nonlinear dimensionality reduction by semidefinite programming and kernel matrix factorization. In: Ghahramani Z., and Cowell R. (Eds). Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics (AISTATS-05) (2005) 381-388
7. Roweis S.T., and Saul L.K. Nonlinear dimensionality reduction by locally linear embedding. Science 290 (2000) 2323-2326
8. Saul L.K., and Roweis S.T. Think globally, fit locally: unsupervised learning of low dimensional manifolds. Journal of Machine Learning Research 4 (2003) 119-155
9. Belkin M., and Niyogi P. Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in Neural Information Processing System 14 (2001) 585-591
10. Belkin M., and Niyogi P. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15 (2003) 1373-1396
11. Zhang Z.Y., and Zha H.Y. Principal manifolds and nonlinear dimensionality reduction via tangent space alignment. SIAM Journal of Scientific Computing 26 1 (2004) 313-338
12. Chen H.F., Jiang G.F., and Yoshihira K. Robust nonlinear dimensionality reduction for manifold learning. Proceeding of 18th International Conference on Pattern Recognition. ICPR (2006) 447-450
13. D. De Ridder, V. Franc, Robust manifold learning, Technical report CTU-CMP-2003-08, Center for Machine Perception, Department of Cybernetics Faculty of Electrical Engineering, Czech Technical University, Prague. pp. 1-36, 2003.
14. L.J.P. Maaten, E.O. Postma, H.J. Herik, Dimensionality reduction: a comparative review. 〈http://www.cs.unimaas.nl/l.vandermaaten/dr/DR_draft.pdf〉.
15. Chang H., and Yeung D.Y. Robust locally linear embedding. Pattern Recognition 39 6 (2006) 1053-1065
16. J. Wang, ZY. Zhang, HY. Zha, Adaptive Manifold Learning, Advances in Neural Information Processing Systems 17, MIT Press, Cambridge, MA, 2005, pp. 1473-1480.
17. F. Lu, S. Keles, et al. Kernel regularization and dimensionality reduction. Technical Report. No 1119, Department of Statistics, University of Wisconsin, 2006.
18. Tikhonov A.N. Regularization of incorrectly posed problems. Soviet Mathematics 4 (1963) 1624-1627
19. M. Belkin, P. Niyogi, V. Sindhwani, Manifold regularization: a geometric framework for learning from examples, Technical Report, University of Chicago, Department of Computer Science, TR-2004-06. Available at: 〈http://www.cs.uchicago.edu/research/publications/techreports/TR-2004-06〉.
20. Borchers B. CSDP, a C library for semidefinite programming. Optimization Methods and Software 11 (1999) 613-623
21. Mika S., Scholkopf B., et al. Kernel PCA and de-noising in feature space. Advances in Neural Information Processing Systems 11 (1999), MIT Press, Cambridge, MA
22. Lavalle S.M., and Branicky M.S. On the relationship between classical grid search and probabilistic roadmaps. Algorithmic Foundations of Robotics V. STAR 7 (2004) 59-75
23. Weinberger K.Q., Sha F., Zhu Q., and Saul L.K. Graph Laplacian regularization for large-scale semidefinite programming. In: Schoelkopf B., Platt J., and Hofmann T. (Eds). Advances in Neural Information Processing Systems 19 (2007), MIT Press, Cambridge, MA. http://www.cs.ucsd.edu/~saul/papers/graph-nips06.pdf Available at: 〈http://www.cs.ucsd.edu/∼saul/papers/graph_ nips06.pdf〉
24. Ham J.H., Lee D.D., and Saul L.K. Semisupervised alignment of manifolds. Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics (AISTATS 05) (2005) 120-127
25. The Wisconsin Diagnostic Breast Cancer dataset, 〈http://archive.ics.uci.edu/ml/datasets/Breast+Cancer+Wisconsin+(Diagnostic)〉.
26. The teapot database, 〈http://www.weinbergerweb.net/Downloads/Data.html〉.
27. The USPS dataset, 〈http://www.cs.toronto.edu/roweis/data.html〉.