Euclidean Embedding of Co-Occurrence Data

Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. This paper describes a method for embedding objects of different types, such as images and text, into a single common Euclidean space based on their co-occurrence statistics. The joint distributions are modeled as exponentials of Euclidean distances in the low-dimensional embedding space, which links the problem to convex optimization over positive semidefinite matrices. The local structure of our embedding corresponds to the statistical correlations via random walks in the Euclidean space. We quantify the performance of our method on two text datasets, and show that it consistently and significantly outperforms standard methods of statistical correspondence modeling, such as multidimensional scaling and correspondence analysis.

• Type: Conference
• Year: 2004
• Where: NIPS
• Authors: Amir Globerson, Gal Chechik, Fernando C. Pereira, Naftali Tishby
• Keywords: Embedding, Euclidean Space, Low-dimensional Embedding Space, NIPS 2004, NIPS 2007