Predicting Recent Links in FOAF Networks

For social networks, prediction of new links or edges can be important for many reasons, in particular for understanding future network growth. Recent work has shown that graph vertex similarity measures are good at predicting graph link formation for the near future, but are less effective in predicting further out. This could imply that recent links can be more important than older links in link prediction. To see if this is indeed the case, we apply a new relation strength similarity (RSS) measure on a coauthorship network constructed from a subset of the CiteSeerX dataset to study the power of recency. We choose RSS because it is one of the few similarity measures designed for weighted networks and easily models FOAF networks. By assigning different weights to the links according to authors coauthoring history, we show that recency is helpful in predicting the formation of new links.

[1]  Sun-Ki Chai,et al.  Social Computing, Behavioral-Cultural Modeling and Prediction , 2014, Lecture Notes in Computer Science.

[2]  Anatol Rapoport,et al.  Spread of information through a population with socio-structural bias: III. Suggested experimental procedures , 1954 .

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[5]  Cane Wing-ki Leung,et al.  Modeling Link Formation Behaviors in Dynamic Social Networks , 2011, SBP.

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

[7]  M. Newman.  Random Graphs as Models of Networks , 2002, cond-mat/0202208.

[8]  C. Lee Giles,et al.  Disambiguating authors in academic publications using random forests , 2009, JCDL '09.

[9]  Xiaolong Zhang,et al.  Capturing missing edges in social networks using vertex similarity , 2011, K-CAP '11.

[10]  Haijun Zhou.  Distance, dissimilarity index, and network community structure. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[12]  A. Rapoport.  Spread of information through a population with socio-structural bias: I. Assumption of transitivity , 1953 .

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

[14]  Vipin Kumar,et al.  Introduction to Data Mining, (First Edition) , 2005 .

[15]  Jon M. Kleinberg,et al.  The Directed Closure Process in Hybrid Social-Information Networks, with an Analysis of Link Formation on Twitter , 2010, ICWSM.

[16]  Jure Leskovec,et al.  Microscopic evolution of social networks , 2008, KDD.

[17]  Xiaolong Zhang,et al.  CollabSeer: a search engine for collaboration discovery , 2011, JCDL '11.

[18]  Daniel T. Larose,et al.  Discovering Knowledge in Data: An Introduction to Data Mining , 2005 .

[19]  Hung-Hsuan Chen,et al.  Discovering missing links in networks using vertex similarity measures , 2012, SAC '12.

[20]  Jon Kleinberg,et al.  The link prediction problem for social networks , 2003, CIKM '03.

[21]  Gerard Salton,et al.  Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer , 1989 .

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

[23]  Yossi Matias,et al.  Suggesting friends using the implicit social graph , 2010, KDD.

[24]  David Liben-Nowell,et al.  The link-prediction problem for social networks , 2007 .

[25]  Paul Erdös,et al.  On random graphs, I , 1959 .