Visualizing pairwise similarity via Semidefinite Programming

Journal of Machine Learning Research

Volumn 2, Issue , 2007, Pages 139-146

  Globerson, Amir ^a   Roweis, Sam ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDINGS; IMAGE EMBEDDING; LOW DIMENSIONAL STRUCTURE; NONLINEAR MAP; OPTIMIZATION PROBLEMS; SAMPLE POINT; SEMI-DEFINITE PROGRAMMING; SEMIDEFINITE PROGRAMS; SIMILARITY MEASUREMENTS; VECTOR REPRESENTATIONS; VIEWING PARAMETERS;

ARTIFICIAL INTELLIGENCE; CONVEX PROGRAMMING; LEARNING ALGORITHMS;

MATHEMATICAL PROGRAMMING;

EID: 84862283468     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (17)

1. Borchers, B. (1999). CSDP, a C library for semidefinite programming. Optimization Methods and Software, 11, 613-623.
2. Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge Univ. Press.
3. Brand, M. (2003). Continuous nonlinear dimensionality reduction by kernel eigenmaps. Proc. of Int. Joint Conf. Artif. Intel..
4. Cox, T., & Cox, M. (1984). Multidimensional scaling. London: Chapman and Hall.
5. Globerson, A., & Roweis, S. (2006). Maximally collapsing metric learning. NIPS, Volume 18.
6. Hadsell, R., Chopra, S., & LeCun, Y. (2006). Dimensionality reduction by learning an invariant mapping. Proc. of CVPR.
7. Harel, D., & Koren, Y. (2002). Graph drawing by highdimensional embedding. Int. Symp. on Graph Drawing.
8. Kaufmann, M., & Wagner, D. (Eds.). (2001). Drawing graphs :methods and models. Springer.
9. LeCun, Y., Huang, F., & Bottou, L. (2004). Learning methods for generic object recognition with invariance to pose and lighting. Proc. of CVPR.
10. Roweis, S., & Saul, L. (2000). Nonlinear dimensionality reduction by locally linear embedding. Science, 290, 2323-6.
11. Schölkopf, B., & Smola, A. J. (Eds.). (2002). Learning with kernels. MIT Press.
12. Shalev-Shwartz, S., Singer, Y., & Ng, A. (2004). Online learning of pseudo-metrics. Proc. of ICML.
13. Sun, J., L., S. B., Xiao, & Diaconis, P. (2006). The fastest mixing markov process on a graph and a connection to a maximum variance unfolding problem. SIAM Review, 48, 681-699.
14. Tenenbaum, J., de Silva, V., & Langford., J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290, 2319-2323.
15. Weinberger, K., Blitzer, J., & Saul, L. (2006). Distance metric learning for large margin nearest neighbor classification. NIPS, Volume 18.
16. Weinberger, K. Q., Packer, B. D., & Saul, L. K. (2005). Nonlinear dimensionality reduction by semidefinite programming and kernel matrix factorization. Proc. of AIS-TATS.
17. Weinberger, K. Q., & Saul, L. K. (2004). Unsupervised learning of image manifolds by semidefinite programming. Proc. of CVPR.