Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries (2003)

Jeremy Kubica Andrew Moore David Cohn Jeff Schneider

Tags

GDA, Link Analysis

Abstract

Many techniques in the social sciences and graph theory deal with the problem of examining and analyzing patterns found in the underlying structure and associations of a group of entities. However, much of this work assumes that this underlying structure is known or can easily be inferred from data, which may often be an unrealistic assumption for many real-world problems. Below we consider the problem of learning and querying a graph-based model of this underlying structure. The model is learned from noisy observations linking sets of entities. We explicitly allow different types of links (representing different types of relations) and temporal information indicating when a link was observed. We quantitatively compare this representation and learning method against other algorithms on the task of predicting future links and new "friendships" in a variety of real world data sets.

Note data sets available at http://www-2.cs.cmu.edu/~jkubica/code/linkds.html

Full text

Download (application/pdf, 88.4 kB)

Approximate BibTeX Entry

@inproceedings{kubica_ICML2003,
    Month = {August},
    Year = {2003},
    Booktitle = {Proceedings of the International Conference on Machine Learning},
    Author = {Jeremy Kubica Andrew Moore David Cohn Jeff Schneider},
    Title = {Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries}
}