A Framework for Dynamic Link Prediction in Heterogeneous Networks

被引:27
作者
Aggarwal, Charu C. [1 ]
Xie, Yan [2 ]
Yu, Philip S. [3 ,4 ]
机构
[1] IBM TJ Watson Res Ctr, Hawthorne, NY 10532 USA
[2] Oracle Amer Inc, Nashua, NH 03062 USA
[3] Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
[4] King Abdulaziz Univ, Dept Comp Sci, Jeddah 21413, Saudi Arabia
关键词
link prediction;
D O I
10.1002/sam.11198
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Network and linked data have become quite prevalent in recent years because of the ubiquity of the web and social media applications, which are inherently network oriented. Such networks are massive, dynamic, contain a lot of content, and may evolve over time. In this paper, we will study the problem of efficient dynamic link inference in temporal and heterogeneous information networks. The problem of efficiently performing dynamic link inference is extremely challenging in massive and heterogeneous information network because of the challenges associated with the dynamic nature of the network, and the different types of nodes and attributes in it. Both the topology and type information need to be used effectively for the link inference process. We propose an effective two-level scheme which makes efficient macro-and micro-decisions for combining structure and content in a dynamic and time-sensitive way. The time-sensitive nature of the links is leveraged in order to perform effective link prediction. We will also study how to apply the method to the problem of community prediction. We illustrate the effectiveness of our technique over a number of real data sets. (C) 2013 Wiley Periodicals, Inc.
引用
收藏
页码:14 / 33
页数:20
相关论文
共 41 条
[1]  
Adafre S., 2005, Proceedings of the 3rd International Workshop on Link Discovery, P90
[2]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[3]  
Aggarwal CC, 2011, SOCIAL NETWORK DATA ANALYTICS, P1, DOI 10.1007/978-1-4419-8462-3
[4]  
Aggarwal CC, 2010, ADV DATABASE SYST, V40, P1, DOI 10.1007/978-1-4419-6045-0
[5]  
[Anonymous], ICDM C
[6]  
[Anonymous], ICDE C
[7]  
[Anonymous], ICDM C
[8]  
[Anonymous], SDM WORKSH LINK AN C
[9]  
[Anonymous], 2012, SDM C
[10]  
[Anonymous], 2002, P 13 ACM C HYP HYP, DOI DOI 10.1145/513338.513381