Local probabilistic models for link prediction

C Wang, V Satuluri… - … conference on data …, 2007 - ieeexplore.ieee.org
C Wang, V Satuluri, S Parthasarathy
Seventh IEEE international conference on data mining (ICDM 2007), 2007ieeexplore.ieee.org
One of the core tasks in social network analysis is to predict the formation of links (ie various
types of relationships) over time. Previous research has generally represented the social
network in the form of a graph and has leveraged topological and semantic measures of
similarity between two nodes to evaluate the probability of link formation. Here we introduce
a novel local probabilistic graphical model method that can scale to large graphs to estimate
the joint co-occurrence probability of two nodes. Such a probability measure captures …
One of the core tasks in social network analysis is to predict the formation of links (i.e. various types of relationships) over time. Previous research has generally represented the social network in the form of a graph and has leveraged topological and semantic measures of similarity between two nodes to evaluate the probability of link formation. Here we introduce a novel local probabilistic graphical model method that can scale to large graphs to estimate the joint co-occurrence probability of two nodes. Such a probability measure captures information that is not captured by either topological measures or measures of semantic similarity, which are the dominant measures used for link prediction. We demonstrate the effectiveness of the co-occurrence probability feature by using it both in isolation and in combination with other topological and semantic features for predicting co-authorship collaborations on three real datasets.
ieeexplore.ieee.org