• DocumentCode
    3165808
  • Title

    Local Probabilistic Models for Link Prediction

  • Author

    Wang, Chao ; Satuluri, Venu ; Parthasarathy, Srinivasan

  • Author_Institution
    Ohio State Univ., Columbus
  • fYear
    2007
  • fDate
    28-31 Oct. 2007
  • Firstpage
    322
  • Lastpage
    331
  • Abstract
    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 real datasets.
  • Keywords
    data mining; very large databases; link prediction; local probabilistic graphical model method; semantic features; social network analysis; topological features; Chaos; Computer science; Data engineering; Data mining; Prediction algorithms; Predictive models; Probability; Social network services; Statistics; Venus;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Mining, 2007. ICDM 2007. Seventh IEEE International Conference on
  • Conference_Location
    Omaha, NE
  • ISSN
    1550-4786
  • Print_ISBN
    978-0-7695-3018-5
  • Type

    conf

  • DOI
    10.1109/ICDM.2007.108
  • Filename
    4470256