Article ID Journal Published Year Pages File Type
485342 Procedia Computer Science 2016 8 Pages PDF
Abstract

Link prediction is an important issue in social networks. Most of the existing methods aim to predict interactions between individuals for static networks, ignoring the dynamic feature of social networks. This paper proposes a link prediction method which considers the dynamic topology of social networks. Given a snapshot of a social network at time t (or network evolution between t1 and t2), we seek to accurately predict the edges that will be added during the interval from time t (or t2) to a given future time t′. Our approach utilizes three metrics, the time-varied weight, the change degree of common neighbor and the intimacy between common neighbors. Moreover, we redefine the common neighbors by finding them within two hops. Experiments on DBLP show that our method can reach better results.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, , , ,