A duality view of spectral methods for dimensionality reduction

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 1041-1048

  Xiao, Lin ^a   Sun, Jun ^b   Boyd, Stephen ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; EMBEDDED SYSTEMS; OPTIMAL SYSTEMS; PROBLEM SOLVING;

DUALITY THEORY; LAPLACIAN EIGENMAPS; NONLINEAR DIMENSIONALITY REDUCTION; SPECTRAL METHODS;

DATA REDUCTION;

EID: 34250785110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143975     Document Type: Conference Paper

References (25)

1. Belkin, M., & Niyogi, P. (2003). Laplacian eigemnaps for dimensionality reduction and data representation. Neural Computation, 15, 1373-1396.
2. Bernstein, M., de Silva, V., Langford, J. C., & Tenenbaum, J. B. (2000). Graph approximations to geodesies on embedded manifolds (Technical Report). Stanford University.
3. Boyd, S., Diaconis, P., & Xiao, L. (2004). Fastest mixing Markov chain on a graph. SIAM Review, problems and techniques section, 46, 667-689.
4. Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press.
5. Brand, M. (2004). From subspaces to submanifolds (Technical Report 2004-134). Mitsubishi Electric Research Laboratories.
6. Burges, C. J. C. (2005). Geometric methods for feature extraction and dimensional reduction. In L. Rokach and O. Maimon (Eds.), Data mining and knowledge discovery handbook: A complete guide for practitioners and researchers. Kluwer Academic Publishers.
7. Costa, J., & Hero, A. O. (2004). Geodesic entropic graphs for dimension and entropy estimation in manifold learning. IEEE Trans. on Signal Process., 52, 2210-2221.
8. Cox, T., & Cox, M. (1994). Multidimensional scaling. London: Chapman & Hall.
9. Donoho, D. L., & Grimes, C. E. (2002). When does Isomap recover the natural parameterization of families of articulated images? (Technical Report 2002-27). Stanford University, Department of Statistics.
10. Donoho, D. L., & Grimes, C. E. (2003). Hessian eigemnaps: locally linear embedding techniques for high-dimensional data. Proceedings of the National Academy of Sciences, 100, 5591-5596.
11. Fiedler, M. (1989). Laplacian of graphs and algebraic connectivity. In Combinatorics and graph theory, vol. 25 of Banach Center Publications, 57-70. Warsaw: PWN-Polish Scientific Publishers.
12. Göring, F., Helmberg, C., & Wappler, M. (2005). Embedded in the shadow of the separator (Preprint 2005-12). Fakultät für Mathematik, Technische Universität Chemnitz, Chemnitz, Germany.
13. Ham, J., Lee, D. D., Mika, S., & Schölkopf, B. (2004). A kernel view of the dimensionality reduction of manifolds. Proceedings of the Twenty-First International Conference on Machine Learning (ICML) (pp. 369-376). Banff, Alberta, Canada.
14. Jolliffe, I. T. (1986). Principal component analysis. New York: Springer-Verlag.
15. Roweis, S. T., & Saul, L. K. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290, 2323-2326.
16. Saul, L. K., & Roweis, S. T. (2003). Think globally, fit locally: unsupervised learning of low dimensional manifolds. Journal of Machine Learning Research, 4, 119-155.
17. Saul, L. K., Weinberger, K. Q., Sha, F., Ham, J., & Lee, D. D. (2005). Spectral methods for dimensionality reduction. In B. Schöelkopf, O. Chapelle and A. Zien (Eds.), Semisupervised learning. MIT Press.
18. Schölkopf, B., Smola, A. J., & Müller, K.-R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10, 1299-1319.
19. Sha, F., & Saul, L. K. (2005). Analysis and extension of spectral methods for nonlinear dimensionality reduction. Proc. of 22nd International Conference on Machine Learning (pp. 785-792). Bonn, Germany.
20. Sun, J., Boyd, S., Xiao, L., & Diaconis, P. (2005). The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem. SIAM Review. Accepted for publication.
21. Tenenbaum, J. B., de Silva, V., & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290, 2319-2323.
22. Vandenberghe, L., & Boyd, S. (1996). Semidefinite programming. SIAM Review, 38, 49-95.
23. Weinberger, K. Q., Packer, B. D., & Saul, L. K. (2005). Nonlinear dimensionality reduction by semidefinite programming and kernel matrix factorization. Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics (pp. 381-388). Barbados, West Indies.
24. Weinberger, K. Q., & Saul, L. K. (2004). Unsupervised learning of image manifolds by semidefinite programming. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR'04) (pp. 988-995). Washington D. C.
25. Zhang, Z., & Zha, H. (2004). Principle manifolds and nonlinear dimensionality reduction via tangent space alignment. SIAM Journal on Scientific Computing, 26, 313-338.