Link prediction using BenefitRanks in weighted networks

被引:6
作者
Lin, Zhijie [1 ]
Xiong, Yun [1 ]
Zhu, Yangyong [1 ]
机构
[1] Fudan Univ, Res Ctr Dataol & DataSci, Sch Comp Sci, Shanghai 200433, Peoples R China
来源
2012 IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON WEB INTELLIGENCE AND INTELLIGENT AGENT TECHNOLOGY (WI-IAT 2012), VOL 1 | 2012年
基金
美国国家科学基金会;
关键词
Link prediction; Weighted network; Markov chain; Similarity measure;
D O I
10.1109/WI-IAT.2012.204
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Link prediction in weighted network is an important task in Social Network Analysis. This problem aims at determining missing links in weighted networks. By taking advantage of the weights and structural information of networks, a mechanism for rating nodes' authorities in terms of the value of weight, called BenefitRank, is defined. This mechanism can flexibly collect different order neighbors' information of nodes to complete the rating authority process for each node in weighted networks. Using BenefitRank combined with the Weak Ties theory, similarity measures are proposed to estimate the emergence of future relationships between nodes in weighted networks. Extensive experiments were carried out on four real weighted networks. Compared with existing methods, our methods can provide higher accuracy for link prediction in weighted networks.
引用
收藏
页码:423 / 430
页数:8
相关论文
共 29 条
[1]   A truer measure of our ignorance [J].
Amaral, Luis A. Nunes .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2008, 105 (19) :6795-6796
[2]  
[Anonymous], WI 07
[3]  
[Anonymous], SCIENCE
[4]  
[Anonymous], SCI NATURELLES
[5]  
[Anonymous], P 27 INT C MACH LEAR
[6]  
[Anonymous], KDD 10
[7]  
[Anonymous], SIGKDD 02
[8]  
[Anonymous], LECT NOTES COMPUTER
[9]  
[Anonymous], SIGKDD 08
[10]  
[Anonymous], CIKM 03