Laplacian eigenmaps for dimensionality reduction and data representation

Neural Computation

Volumn 15, Issue 6, 2003, Pages 1373-1396

  Belkin, Mikhail ^a   Niyogi, Partha ^b  

^a UNIVERSITY OF CHICAGO   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042378381     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976603321780317     Document Type: Article

References (19)

1. Belkin, M., & Niyogi, P. (2002). Laplacian eigenmaps and spectral techniques for embedding and clustering. In T. K. Leen, T. G. Dietterich, & V. Tresp (Eds.), Advances in neural information processing systems, 14. Cambridge, MA: MIT Press.
2. Bernstein, M., de Silva, V., Langford, J. C., & Tenenbaum, J. B. (2000). Graph approximations to geodesics on embedded manifolds. Available on-line: http://isomap.stanford.edu/BdSLT.pdf.
3. Chung, Fan R. K. (1997). Spectral graph theory. Providence, RI: American Mathematical Society.
4. Chung, Fan R. K., Grigor'yan, A., & Yau, S.-T. (2000). Higher eigenvalues and isoperimetric inequalities on Riemannian manifolds and graphs. Communications on Analysis and Geometry, 8, 969-1026.
5. Hadley, S. W., Mark, B. L., & Vanelli, A. (1992). An efficient eigenvector approach for finding netlist partitions. IEEE Transactions on Computer-Aided Design, 11(7), 885-892.
6. Haykin, S. (1999). Neural networks: A comprehensive foundation. Upper Saddle River, NJ: Prentice Hall.
7. Hendrickson, B., & Leland, R. (1993). Multidimensional spectral load balancing. In Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing (pp. 953-961). Philadelphia: SIAM.
8. Indyk, P. (2000). Dimensionality reduction techniques for proximity problems. Paper presented at the Eleventh Symposium on Discrete Algorithms, San Francisco.
9. Kondor, R. I., & Lafferty, J. (2002). Diffusion kernels on graphs and other discrete input spaces. In Proceedings of the ICML 2002.
10. 1 isometric imbeddings. Annals of Mathematics, 56, 383-396.
11. Nash, J. (1956). The imbedding problem for Riemannian Manifolds. Annals of Mathematics, 63, 20-63.
12. Ng, A. Y., Jordan, M., & Weiss, Y. (2002). On spectral clustering: Analysis and an algorithm. In T. K. Leen, T. G. Dietterich, & V. Tresp (Eds.), Advances in neural information processing systems, 14. Cambridge, MA: MIT Press.
13. Rosenberg, S. (1997). The Laplacian on a Riemannian manifold. Cambridge: Cambridge University Press.
14. Roweis, S. T., & Saul, L. K. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290, 2323-2326.
15. Schölkopf, B., Smola, A., & Mülller, K.-R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5), 1299-1319.
16. Seung, H. S., & Lee, D. D. (2000). The manifold way of perception. Science, 290, 2268-2269.
17. Shi, J., & Malik, J. (1997). Normalized cuts and image segmentation. IEEE Conf. Computer Vision and Pattern Recognition (pp. 731-737).
18. Simon, H. D. (1991). Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering, 2, 135-148.
19. Tenenbaum, J., de Silva, V., & Langford, J. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290, 2319-2323.