Search

Navigator: RI | Publications | Approximate Kalman Filters for Embedding Author-Word Co-occurrence Data over Time

Graphics enhanced version of this site

Approximate Kalman Filters for Embedding Author-Word Co-occurrence Data over Time
P. Sarkar, S. Siddiqi, and G. Gordon
Workshop on Statistical Network Analysis at the Twenty-third International Conference on Machine Learning (ICML), 2006.

Jump to: Download | Abstract | Text Reference | BibTeX Reference


Download [Help]

Adobe portable document format (pdf) [356 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


Abstract

We address the problem of embedding enti ties into Euclidean space over time based on co-occurrence data. We extend the CODE model of Globerson et al. (2004) to a dynamic setting. This leads to a non-standard factored state space model with real-valued hidden parent nodes and discrete observation nodes. We investigate the use of variational approximations applied to the observation model that allow us to formulate the entire dynamic model as a Kalman Flter. Applying this model to temporal co-occurrence data yields posterior distributions of entity coordinates in Euclidean space that are updated over time. Initial results on per-year co-occurrences of authors and words in the NIPS corpus and on synthetic data, including videos of dynamic embeddings, seem to indicate that the model results in embeddings of co-occurrence data that are meaningful both temporally and contextually.


Text Reference

P. Sarkar, S. Siddiqi, and G. Gordon, "Approximate Kalman Filters for Embedding Author-Word Co-occurrence Data over Time," Workshop on Statistical Network Analysis at the Twenty-third International Conference on Machine Learning (ICML), 2006.


BibTeX Reference

@inproceedings{Sarkar_2006_5689,
   author = "Purnamrita Sarkar and Sajid Siddiqi and Geoffrey Gordon",
   title = "Approximate Kalman Filters for Embedding Author-Word Co-occurrence Data over Time",
   booktitle = "Workshop on Statistical Network Analysis at the Twenty-third International Conference on Machine Learning (ICML)",
   year = "2006"
}


The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University.
For updates and comments, please see these instructions.
This page maintained by robotwebmaster@ri.cmu.edu