Manifold learning algorithms based on spectral graph theory

Jisuanji Yanjiu yu Fazhan/Computer Research and Development

Volumn 43, Issue 7, 2006, Pages 1173-1179

  Luo, Siwei ^a   Zhao, Lianwei ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

Eigenmaps; Local tangent space; Manifold learning; Random walk; Spectral graph theory

Indexed keywords

DATA PROCESSING; GRAPH THEORY;

EIGENMAPS; LOCAL TANGENT SPACE; MANIFOLD LEARNING; RANDOM WALK; SPECTRAL GRAPH THEORY;

LEARNING ALGORITHMS;

EID: 33747403370     PISSN: 10001239     EISSN: None     Source Type: Journal    
DOI: 10.1360/crad20060707     Document Type: Article

References (46)

1. H. Sebastian Seung, Daniel D. Lee. The manifold ways of perception [J]. Science, 2000, 290(12): 2268-2269
2. Chen Xingshen, Chen Weihuan. Lecture Notes in Differentiable Manifold [M]. Beijing: Peking University Press, 1983 (in Chinese)
3. Andrew Y. Ng, Michael I. Jordan, Yair Weiss. On spectral clustering: Analysis and an algorithm [G]. In: Advances in NIPS 14. Cambridge, MA: MIT Press, 2001. 849-856
4. J. Shawe-Taylor, N. Cristianini, J. Kandola. On the concentration of spectral properties [G]. In: Advances in NIPS 14. Cambridge, MA: MIT Press, 2001. 511-517
5. F. R. K. Chung. Spectral Graph Theory [M]. Fresno: American Mathematical Society. 1997
6. B. Scholkopf, A. Smola, K-R. Muller. Nonlinear component analysis as a kernel eigenvalue problem [J]. Neural Computation, 1998, 10(5): 1299-1319
7. T. Hastie, W. Stuetzle. Principal curves [J]. Journal of the American Statistical Association, 1989, 84(406): 502-516
8. Zhang Junping, Wang Jue. An overview of principal curves [J]. Chinese Journal of Computers, 2003, 26(2): 126-146 (in Chinese)
9. Zhang Junping. Manifold learning and its applications: [Ph. D. dissertation] [D]. Beijing: Institute of Automation, Chinese Academy of Sciences, 2003 (in Chinese)
10. T. Cox, M. Cox. Multidimensional Scaling [M]. London: Chapman and Hall, 1994
11. J. B. Tenenbaum, V. de Silva, J. C. Langford. A global geometric framework for nonlinear dimensionality reduction [J]. Science, 2000, 290(12): 2319-2323
12. M. Balasubramanian, E. L. Schwartz. The isomap algorithm and topological stability [J]. Science, 2002, 295(5552): 7
13. D. Donoho, C. Grimes. When does ISOMAP recover the natural parameterization of families of articulated images? [R]. Department of Statistics, Stanford University, Tech. Rep.: 2002-27, 2002
14. V. De Silva, J. B. Tenenbaum. Global versus local methods in nonlinear dimensionality reduction [G]. In: Advances in NIPS 15. Cambridge, MA: MIT Press, 2002. 705-712
15. S. T. Roweis, L. K. Saul. Nonlinear dimensionality analysis by locally linear embedding [J]. Science, 2000, 290(12): 2323-2326
16. L. K. Saul, S. T. Roweis. Think globally, fit locally: Unsupervised learning of low dimensional manifolds [J]. Journal of Machine Learning Research, 2003, 4(6): 119-155
17. Zhang Changshui, Wang Jun, Zhao Nanyuan, et al. Reconstruction and analysis of multi-pose face images based on nonlinear dimensionality reduction [J]. Pattern Recognition, 2004, 37(1): 325-336
18. Zhang Zhenyue, Zha Hongyuan. Principal manifolds and nonlinear dimensionality reduction via tangent space alignment [J]. SIAM Journal of Scientific Computing, 2004, 26(1): 313-338
19. Zhang Zhenyue, Zha Hongyuan. Linear low-rank approximations and nonlinear dimensionality reduction [J]. Science in China Series A-Mathematics, 2005, 35(3): 273-285 (in Chinese)
20. Wang Jing, Zhang Zhenyue, Zha Hongyuan. Adaptive manifold learning [G]. In: Advances in NIPS 17. Cambridge, MA: MIT Press, 2004
21. Yang Jian, Li Fuxin, Wang Jue. A better scaled local tangent space alignment algorithm [J]. Journal of Software, 2005, 16(9): 1584-1590 (in Chinese)
22. M. Brand. Charting a manifold [G]. In: Advances in NIPS 15. Cambridge, MA: MIT Press, 2002. 961-968
23. M. Belkin, P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering [G]. In: Advances in NIPS 14. Cambridge, MA: MIT Press, 2001. 585-591
24. M. Belkin, P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation [J]. Neural Computation, 2003, 15(6): 1373-1396
25. M. Belkin, P. Niyogi. Toward a theoretical foundation for Laplacian-based manifold methods [G]. In: Proc. 18th Annual Conf. Learning Theory, LNCS 3559. Berlin: Springer-Verlag, 2005. 486-500
26. M. Belkin, P. Niyogi. Using manifold structure for partially labeled classification [G]. In: Advances in NIPS 15. Cambridge, MA: MIT Press, 2002. 929-936
27. M. Belkin, P. Niyogi, V. Sindhwani. Manifold regularization: A geometric framework for learning from examples [R]. Department of Computer Science, University of Chicago, Tech. Rep.: TR-2004-06, 2004
28. D. Donoho, C. Grimes. Hessian Eigenmaps: New locally linear embedding techniques for high-dimensional data [J]. Proceedings of the National Academy of Sciences, 2003, 100(10): 5591-5596
29. R. R. Coifman, S. Lafon, A. B. Lee, et al. Geometric diffusions as a tool for harmonic analysis and structure definition of data. Part I: Diffusion maps [J]. Proceedings of the National Academy of Sciences, 2005, 102(21): 7426-7431
30. R. R. Coifman, S. Lafon, A. B. Lee, et al. Geometric diffusions as a tool for harmonic analysis and structure definition of data. Part II: Multiscale methods [J]. Proceedings of the National Academy of Sciences, 2005, 102(21): 7432-7437
31. B. Nadler, S. Lafon, R. R. Coifman, et al. Diffusion maps, spectral clustering and eigenfunctions of Fokker-Planck operators [G]. In: Advances in NIPS 17. Cambridge, MA: MIT Press, 2004
32. M. Szummer, T. Jaakkola. Partially labeled classification with Markov random walks [G]. In: Advances in NIPS 14. Cambridge, MA: MIT Press, 2001. 945-952
33. Zhou Dengyong, Scholkopf Bernhard. Learning from labeled and unlabeled data using random walks [G]. In: Proc. 26th DAGM Symposium Pattern Recognition, LNCS 3175. Berlin: Springer-Verlag, 2004. 237-244
34. Ham Jihun, Daniel D. Lee, Sebastian Mika, et al. A kernel view of the dimensionality reduction of manifolds [C]. ICML 2004, Banff, Alberta, Canada, 2004
35. Y. Bengio, J. Paiement, P. Vincent. Out-of-sample extensions for LLE, Isomap, MDS, Eigenmaps and spectral clustering [G]. In: Advances in NIPS 16. Cambridge, MA: MIT Press, 2003
36. T. Kohonen. Self-Organizing Maps [M]. Berlin: Springer-Verlag, 1995
37. Christopher M. Bishop, Markus Svensen, Christopher K. I, Williams. GTM: The generative topographic mapping [J]. Neural Computation, 1998, 10(1): 215-234
38. Zhou Zhihua, Cao Cungen. Neural network and its applications [G]. Beijing: Tsinghua University Press, 2004 (in Chinese)
39. Francesco Camastra. Data dimensionality estimation methods: A survey [J]. Pattern Recognition, 2003, 36(12): 2945-2954
40. M. Hein, Y. Audibert. Intrinsic dimensionality estimation of submanifolds in Rd [C]. ICML 2005, Bonn, Germany, 2005
41. Elizaveta Levina, Peter J. Bickel. Maximum likelihood estimation of intrinsic dimension [G]. In: Advances in NIPS 17. Cambridge, MA: MIT Press, 2004
42. T. Poggio, S. Smale. The mathematics of learning: Dealing with data [J]. Not. American Mathematics Society, 2003, 50(5): 537-544
43. T. Poggio, R. Rifkin, S. Mukherjee, et al. General conditions for predictivity in learning theory [J]. Nature, 2004, 428(3): 419-422
44. Carlo Tomasi. Learning theory: Past performance and future results [J]. Nature, 2004, 428(3): 378
45. K. Weinberger, L. Saul. Unsupervised learning of image manifolds by semidefinite programming [C]. In: Proc. CVPR 2004(2). Los Alamitos: IEEE Computer Society Press, 2004. 988-995
46. A. Elgammal, C. S. Lee. Inferring 3D body pose from silhouettes using activity manifold learning [C]. In: Proc. CVPR 2004(2). Los Alamitos: IEEE Computer Society Press, 2004. 681-688