Nonlinear dimensionality reduction by semidefinite programming and kernel matrix factorization

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

Volumn , Issue , 2005, Pages 381-388

  Weinberger, Kilian Q ^a   Packer, Benjamin D ^a   Saul, Lawrence K ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TIME; FEATURE SPACE; HIGH DIMENSIONAL DATA; INNER PRODUCT; KERNEL MATRICES; LOW-DIMENSIONAL MANIFOLDS; MANIFOLD LEARNING; NEAREST NEIGHBORS; NONLINEAR DIMENSIONALITY REDUCTION; SEMI-DEFINITE PROGRAMMING; SEMI-SUPERVISED LEARNING; SEMIDEFINITE PROGRAMS; SUBMATRIX;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; NONLINEAR ANALYSIS; SUPERVISED LEARNING;

MATHEMATICAL PROGRAMMING;

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

References (27)

1. M. Belkin, I. Matveeva, and P. Niyogi. Regularization and semi-supervised learning on large graphs. In Proceedings of the Seventeenth Annual Conference on Computational Learning Theory (COLT 2004), pages 624-638, Banff, Canada, 2004.
2. M. Belkin and P. Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373-1396, 2003.
3. Y. Bengio, J-F. Paiement, and P. Vincent. Out-of-sample extensions for LLE, Isomap, MDS, eigenmaps, and spectral clustering. In S. Thrun, L. K. Saul, and B. Schölkopf, editors, Advances in Neural Information Processing Systems 16, Cambridge, MA, 2004. MIT Press.
4. B. Borchers. CSDP, a C library for semidefinite programming. Optimization Methods and Software 11(1):613-623, 1999.
5. M. Brand. Charting a manifold. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, pages 985-992, Cambridge, MA, 2003. MIT Press.
6. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines. Cambridge University Press, Cambridge, UK, 2000.
7. V. de Silva and J. B. Tenenbaum. Global versus local methods in nonlinear dimensionality reduction. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, pages 721-728, Cambridge, MA, 2003. MIT Press.
8. D. L. Donoho and C. E. Grimes. Hessian eigen-maps: locally linear embedding techniques for high-dimensional data. Proceedings of the National Academy of Arts and Sciences, 100:5591-5596, 2003.
9. J. Ham, D. D. Lee, S. Mika, and B. Schölkopf. A kernel view of the dimensionality reduction of manifolds. In Proceedings of the Twenty First International Conference on Machine Learning (ICML-04), pages 369-376, Banff, Canada, 2004.
10. J. J. Hull. A database for handwritten text recognition research. IEEE Transaction on Pattern Analysis and Machine Intelligence, 16(5):550-554, May 1994.
11. J. C. Platt. Fast embedding of sparse similarity graphs. In S. Thrun, L. K. Saul, and B. Schölkopf, editors, Advances in Neural Information Processing Systems 16, Cambridge, MA, 2004. MIT Press.
12. J. C. Platt. FastMap, MetricMap, and landmark MDS are all nyström algorithms. In Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, Barbados, WI, January 2005.
13. S. T. Roweis and L. K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290: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:119-155, 2003.
15. B. Schölkopf, A. J. Smola, and K.-R. Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10:1299-1319, 1998.
16. A. J. Smola and R. Kondor. Kernels and regularization on graphs. In Proceedings of the Sixteenth Annual Conference on Computational Learning Theory and Kernel Workshop, Washington D.C., 2003.
17. J. Sun, S. Boyd, L. Xiao, and P. Diaconis. The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem. SIAM Review, submitted.
18. M. Szummer and T. Jaakkola. Partially labeled classification with Markov random walks. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.
19. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000.
20. L. Vandenberghe and S. P. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, March 1996.
21. K. Q. Weinberger and L. K. Saul. Unsupervised learning of image manifolds by semidefinite programming. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR-04), volume 2, pages 988-995, Washington D.C., 2004.
22. K. Q. Weinberger, F. Sha, and L. K. Saul. Learning a kernel matrix for nonlinear dimensionality reduction. In Proceedings of the Twenty First International Conference on Machine Learning (ICML-04), pages 839-846, Banff, Canada, 2004.
23. C. K. I. Williams. On a connection between kernel PCA and metric multidimensional scaling. In T. K. Leen, T. G. Dietterich, and V. Tresp, editors, Advances in Neural Information Processing Systems 13, pages 675-681, Cambridge, MA, 2001. MIT Press.
24. Christopher K. I. Williams and Matthias Seeger. Using the Nyström method to speed up kernel machines. In T. Leen, T. Dietterich, and V. Tresp, editors, Neural Information Processing Systems 13, pages 682-688, Cambridge, MA, 2001. MIT Press.
25. Z. Zhang and H. Zha. Principal manifolds and nonlinear dimensionality reduction by local tangent space alignment. SIAM Journal of Scientific Computing, in press.
26. D. Zhou, O. Bousquet, T. N. Lai, J. Weston, and B. Schölkopf. Learning with local and global consistency. In S. Thrun, L. K. Saul, and B. Schölkopf, editors, Advances in Neural Information Processing Systems 16, pages 321-328, Cambridge, MA, 2004. MIT Press.
27. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using Gaussian fields and harmonic functions. In Proceedings of the Twentieth International Conference on Machine Learning (ICML 2003), pages 912-919, Washington D.C., 2003.