Skip to main content
Article thumbnail
Location of Repository


By Mohammad Al Hasan and Mohammed J. Zaki


Link prediction is an important task for analying social networks which also has applications in other domains like, information retrieval, bioinformatics and e-commerce. There exist a variety of techniques for link prediction, ranging from feature-based classi�cation and kernel-based method to matrix factorization and probabilistic graphical models. These methods differ from each other with respect to model complexity, prediction performance, scalability, and generalization ability. In this article, we survey some representative link prediction methods by categorizing them by the type of the models. We largely consider three types of models: �rst, the traditional (non-Bayesian) models which extract a set of features to train a binary classi�cation model. Second, the probabilistic approaches which model the joint-probability among the entities in a network by Bayesian graphical models. And, �nally the linear algebraic approach which computes the similarity between the nodes in a network by rank-reduced similarity matrices. We discuss various existing link prediction models that fall in these broad categories and analyze their strength and weakness. We conclude the survey with a discussion on recent developments and future research direction. Keywords: Link prediction, network evolution model, social network analysis, probabilistic

Topics: DOI 10.1007/978-1-4419-8462-3_9, © Springer Science+Business Media, LLC 2011244 SOCIAL NETWORK DATA ANALYTICS
Publisher: 2013-09-21
Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.