Embedding heterogeneous data using statistical models

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1605-1608

  Globerson, Amir ^a   Chechik, Gal ^b   Pereira, Fernando ^c   Tishby, Naftali ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Stanford University   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

^d HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX DATA; EMBEDDING ALGORITHMS; EUCLIDEAN SPACE; SEMIDEFINITE MATRICES;

DATA STRUCTURES; EMBEDDED SYSTEMS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; STATISTICAL METHODS;

DATA REDUCTION;

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

References (10)

1. Chechik, G., and Tishby, N. 2002. Extracting relevant structures with side information. In Becker, S.; Thrun, S.; and Obermayer, K., eds., NIPS 15.
2. Chechik, G. 2005. The NIPS 0-17 database. http://robotics.stanford.edu/ ~gal/.
3. Cox, T., and Cox, M. 1984. Multidimensional Scaling. London: Chapman and Hall.
4. Fisher, R. 1940. The percision of discriminant functions. Ann. Eugen. Lond. 10:422-429.
5. Globerson, A.; Chechik, G.; Pereira, F.; and N.Tishby. 2005. Euclidean embedding of co-occurrence data. In Saul, L. K.; Weiss, Y.; and Bottou, L., eds., NIPS 17.
6. Greenacre, M. 1984. Theory and applications of correspondence analysis. Academic Press.
7. Hinton, G., and Roweis, S. 2002. Stochastic neighbor embedding. In NIPS 15.
8. Hotelling, H. 1935. The most predictable criterion. Journal of Educational Psych. 26:139-142.
9. Roweis, S. T., and Saul, L. K. 2000. Nonlinear dimensionality reduction by locally linear embedding. Science 290:2323-2326.
10. Weinberger, K., and Saul, L. 2004. Unsupervised learning of image manifolds by semideflnite programming. In CVPR.