TY - GEN
T1 - When will it happen? - Relationship prediction in heterogeneous information networks
AU - Sun, Yizhou
AU - Han, Jiawei
AU - Aggarwal, Charu C.
AU - Chawla, Nitesh V.
PY - 2012
Y1 - 2012
N2 - Link prediction, i.e., predicting links or interactions between objects in a network, is an important task in network analysis. Although the problem has attracted much attention recently, there are several challenges that have not been addressed so far. First, most existing studies focus only on link prediction in homogeneous networks, where all objects and links belong to the same type. However, in the real world, heterogeneous networks that consist of multi-typed objects and relationships are ubiquitous. Second, most current studies only concern the problem of whether a link will appear in the future but seldom pay attention to the problem of when it will happen. In this paper, we address both issues and study the problem of predicting when a certain relationship will happen in the scenario of heterogeneous networks. First, we extend the link prediction problem to the relationship prediction problem, by systematically defining both the target relation and the topological features, using a meta path-based approach. Then, we directly model the distribution of relationship building time with the use of the extracted topological features. The experiments on citation relationship prediction between authors on the DBLP network demonstrate the effectiveness of our methodology.
AB - Link prediction, i.e., predicting links or interactions between objects in a network, is an important task in network analysis. Although the problem has attracted much attention recently, there are several challenges that have not been addressed so far. First, most existing studies focus only on link prediction in homogeneous networks, where all objects and links belong to the same type. However, in the real world, heterogeneous networks that consist of multi-typed objects and relationships are ubiquitous. Second, most current studies only concern the problem of whether a link will appear in the future but seldom pay attention to the problem of when it will happen. In this paper, we address both issues and study the problem of predicting when a certain relationship will happen in the scenario of heterogeneous networks. First, we extend the link prediction problem to the relationship prediction problem, by systematically defining both the target relation and the topological features, using a meta path-based approach. Then, we directly model the distribution of relationship building time with the use of the extracted topological features. The experiments on citation relationship prediction between authors on the DBLP network demonstrate the effectiveness of our methodology.
KW - Algorithms
UR - http://www.scopus.com/inward/record.url?scp=84863298375&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863298375&partnerID=8YFLogxK
U2 - 10.1145/2124295.2124373
DO - 10.1145/2124295.2124373
M3 - Conference contribution
AN - SCOPUS:84863298375
SN - 9781450307475
T3 - WSDM 2012 - Proceedings of the 5th ACM International Conference on Web Search and Data Mining
SP - 663
EP - 672
BT - WSDM 2012 - Proceedings of the 5th ACM International Conference on Web Search and Data Mining
T2 - 5th ACM International Conference on Web Search and Data Mining, WSDM 2012
Y2 - 8 February 2012 through 12 February 2012
ER -