Collective Prediction of Multiple Types of Links in Heterogeneous Information Networks

被引:34
作者
Cao, Bokai [1 ]
Kong, Xiangnan [2 ]
Yu, Philip S. [1 ]
机构
[1] Univ Illinois, Dept Comp Sci, Chicago, IL 60607 USA
[2] Worcester Polytech Inst, Dept Comp Sci, Worcester, MA 01609 USA
来源
2014 IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM) | 2014年
关键词
collective link prediction; heterogeneous information networks; meta path; MODELS;
D O I
10.1109/ICDM.2014.25
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Link prediction has become an important and active research topic in recent years, which is prevalent in many real-world applications. Current research on link prediction focuses on predicting one single type of links, such as friendship links in social networks, or predicting multiple types of links independently. However, many real-world networks involve more than one type of links, and different types of links are not independent, but related with complex dependencies among them. In such networks, the prediction tasks for different types of links are also correlated and the links of different types should be predicted collectively. In this paper, we study the problem of collective prediction of multiple types of links in heterogeneous information networks. To address this problem, we introduce the linkage homophily principle and design a relatedness measure, called RM, between different types of objects to compute the existence probability of a link. We also extend conventional proximity measures to heterogeneous links. Furthermore, we propose an iterative framework for heterogeneous collective link prediction, called HCLP, to predict multiple types of links collectively by exploiting diverse and complex linkage information in heterogeneous information networks. Empirical studies on real-world tasks demonstrate that the proposed collective link prediction approach can effectively boost link prediction performances in heterogeneous information networks.
引用
收藏
页码:50 / 59
页数:10
相关论文
共 29 条
  • [1] Friends and neighbors on the Web
    Adamic, LA
    Adar, E
    [J]. SOCIAL NETWORKS, 2003, 25 (03) : 211 - 230
  • [2] [Anonymous], 2010, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, Association for Computing Machinery
  • [3] [Anonymous], 2005, ACM SIGKDD EXPLOR NE
  • [4] [Anonymous], 2012, Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, DOI DOI 10.1145/2339530.2339738
  • [5] Blum A., 1998, Proceedings of the Eleventh Annual Conference on Computational Learning Theory, P92, DOI 10.1145/279943.279962
  • [6] LIBSVM: A Library for Support Vector Machines
    Chang, Chih-Chung
    Lin, Chih-Jen
    [J]. ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2011, 2 (03)
  • [7] Assessing Drug Target Association Using Semantic Linked Data
    Chen, Bin
    Ding, Ying
    Wild, David J.
    [J]. PLOS COMPUTATIONAL BIOLOGY, 2012, 8 (07)
  • [8] Prediction of Drug-Target Interactions and Drug Repositioning via Network-Based Inference
    Cheng, Feixiong
    Liu, Chuang
    Jiang, Jing
    Lu, Weiqiang
    Li, Weihua
    Liu, Guixia
    Zhou, Weixing
    Huang, Jin
    Tang, Yun
    [J]. PLOS COMPUTATIONAL BIOLOGY, 2012, 8 (05)
  • [9] Davis D., 2011, P INT C ADV SOC NETW
  • [10] Biomine: predicting links between biological entities using network models of heterogeneous databases
    Eronen, Lauri
    Toivonen, Hannu
    [J]. BMC BIOINFORMATICS, 2012, 13