Semisupervised alignment of manifolds

AISTATS 2005 - Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics

Volumn , Issue , 2005, Pages 120-127

  Ham, Jihun ^a   Lee, Daniel D ^a   Saul, Lawrence K ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CURSE OF DIMENSIONALITY; DATA SETS; IMAGE MANIFOLDS; LOW DIMENSIONAL STRUCTURE; MANIFOLD LEARNING; MANIFOLD STRUCTURES; PARAMETERIZED; PARTIAL ALIGNMENT; PRIOR KNOWLEDGE; SEMI-SUPERVISED; VIEWING ANGLE;

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84862595041     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. D. Aldous and J. Fill. Reversible Markov chains and random walks on graphs, 2002. In preparation.
2. M. Belkin, I. Matveeva, and P. Niyogi. Regularization and regression on large graphs. In Proceedings of 17th Annual Conference on Learning Theory, pages 624-638, 2004.
3. M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15, pages 1373-1396, 2003.
4. A. Berman and R. J. Plemmons. Nonnegative Matrices in the Mathematical Science. Academic Press, New York, 1996.
5. M. Brand. Charting a manifold. In Advances in Neural Information Processing Systems 15, pages 961-968, Cambridge, MA, 2003. MIT Press.
6. A. K. Chandra, P. Raghavan, W. L. Ruzzo, and R. Smolensky. The electrical resistance of a graph captures its commute and cover times. In Proceedings of the twenty-first annual ACM symposium on Theory of computing, pages 574-586. ACM Press, 1989.
7. D. L. Donoho and C. Grimes. Hessian eigen-maps: locally linear embedding techniques for high-dimensional data. In Proceedings of National Academy of Science, 100 (10), pages 5591-5596, 2003.
8. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its applications to graph theory. Czechoslovak Math Journal, 25 (100), pages 619-633, 1975.
9. S. Guattery. Graph embeddings, symmetric real matrices, and generalized inverses. Technical Report NASA/CR-1998-208462 ICASE Report No. 98-34, Institute for Computer Applications in Science and Engineering, August 1998.
10. J. Ham, D. D. Lee, S. Mika, and B. Schölkopf. Kernel view of the dimensionality reduction of manifolds. In Proceedings of International Conference on Machine Learning, 2004.
11. J. Ham, D. D. Lee, and L. K. Saul. Learning high-dimensional correspondences from low-dimensional manifolds. In Workshop on The Continuum from Labeled to Unlabled Data in Machine Learning and Data Mining at Twentieth International Conference on Machine Learning, pages 34-39, 2003.
12. I. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete structures. In Proceedings of International Conference on Machine Learning, 2002.
13. S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290, pages 2323-2326, 2000.
14. L. K. Saul and S. T. Roweis. Think globally, fit locally: unsupervised learning of low dimensional manifolds. Journal of Machine Learning Research, 4, pages 119-155, 2003.
15. J. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290, pages 2319-2323, 2000.
16. J. J. Verbeek, S. T. Roweis, and N. Vlassis. Nonlinear CCA and PCA by alignment of local models. In Advances in Neural Information Processing Systems 16, 2004.
17. D. Zhou and B. Schölkopf. A regularization framework for learning from graph data. In Workshop on Statistical Relational Learning at Twenty-first International Conference on Machine Learning, 2004.
18. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In Proceedings of International Conference on Machine Learning, pages 912-919, 2003.