A Novel Strategy for Link Prediction in Social Networks

The problem of link prediction has gained a lot of attention recently from the research community. It can be formalized as, given a snapshot of a social network at time t, can it be predicted which new connections among its members are likely to occur in the future at time t'. Apart from analysing social networks, it has also found application in other domains e.g., information retrieval, bio-informatics and e-commerce. Topological information of the network, i.e. the information about the present nodes and links, can be used to predict the future links in the network. As an example, "Common neighbors" method is a trivial but efficient strategy for predicting the possibility of a link between a pair of nodes. Many variants of the common neighbors method have been proposed to address this problem. In this paper, we propose a novel strategy for predicting the missing links which also takes into account the number of links between two sets of uncommon neighbors of given nodes, in addition to their common neighbors.

[1]  Pavel Yu. Chebotarev,et al.  The Matrix-Forest Theorem and Measuring Relations in Small Social Groups , 2006, ArXiv.

[2]  A. Barabasi,et al.  Hierarchical Organization of Modularity in Metabolic Networks , 2002, Science.

[3]  M. Newman,et al.  Vertex similarity in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  J. Hanley,et al.  The meaning and use of the area under a receiver operating characteristic (ROC) curve. , 1982, Radiology.

[5]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[6]  Linyuan Lu,et al.  Link Prediction in Complex Networks: A Survey , 2010, ArXiv.

[7]  Mohammad Al Hasan,et al.  A Survey of Link Prediction in Social Networks , 2011, Social Network Data Analytics.

[8]  Christopher M. Danforth,et al.  An evolutionary algorithm approach to link prediction in dynamic social networks , 2013, J. Comput. Sci..

[9]  P. Jaccard,et al.  Etude comparative de la distribution florale dans une portion des Alpes et des Jura , 1901 .

[10]  Rami Puzis,et al.  Link Prediction in Social Networks Using Computationally Efficient Topological Features , 2011, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing.

[11]  Lada A. Adamic,et al.  Friends and neighbors on the Web , 2003, Soc. Networks.

[12]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[13]  Hierarchical Organization of Modularity in Metabolic Networks Supporting Online Material , 2002 .

[14]  Lise Getoor,et al.  Link mining: a survey , 2005, SKDD.

[15]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[16]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[17]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[18]  Rami Puzis,et al.  Computationally efficient link prediction in a variety of social networks , 2013, ACM Trans. Intell. Syst. Technol..

[19]  Jennifer Widom,et al.  SimRank: a measure of structural-context similarity , 2002, KDD.

[20]  Michael McGill,et al.  Introduction to Modern Information Retrieval , 1983 .

[21]  Linyuan Lü,et al.  Predicting missing links via local information , 2009, 0901.0553.

[22]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[23]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .