Heat conduction information filtering via local information of bipartite networks

被引:25
作者
Guo, Q. [1 ,2 ]
Leng, R. [1 ]
Shi, K. [1 ]
Liu, J. G. [1 ,3 ]
机构
[1] Shanghai Univ Sci & Technol, Res Ctr Complex Syst Sci, Shanghai 200093, Peoples R China
[2] Univ Fribourg, Dept Phys, CH-1700 Fribourg, Switzerland
[3] Univ Oxford, Said Business Sch, CABDyN Complex Ctr, Oxford OX1 1HP, England
关键词
EMPIRICAL-ANALYSIS; RECOMMENDATION; EMERGENCE; ALGORITHM; GRAPHS;
D O I
10.1140/epjb/e2012-30095-1
中图分类号
O469 [凝聚态物理学];
学科分类号
070205 ;
摘要
Information filtering based on structure properties of user-object bipartite networks is of both theoretical interest and practical significance in modern science. In this paper, we empirically investigate the framework of heat-conduction-based (HC) information filtering [Y.-C. Zhang et al., Phys. Rev. Lett. 99, 154301 (2007)] in terms of the local node similarity. We compare nine well-known local similarity measures on four real networks. The results indicate that the local-heat-conduction-based similarity has the best accuracy and diversity simultaneously. Embedding the object degree effect into the heat conduction process, we present a new user similarity measure. Experimental results on four real networks demonstrate that the improved similarity measure could generate remarkably higher diversity and novelty results than the state-of-the-art HC information filtering algorithms based on local information, and the accuracy is also increased greatly or approximately unchanged. Since the improved similarity index only need the local information of user-object bipartite networks, it is therefore a strong candidate for potential application in information filtering of large-scale bipartite networks.
引用
收藏
页数:8
相关论文
共 53 条
[1]   Friends and neighbors on the Web [J].
Adamic, LA ;
Adar, E .
SOCIAL NETWORKS, 2003, 25 (03) :211-230
[2]   Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions [J].
Adomavicius, G ;
Tuzhilin, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) :734-749
[3]   Synchronization reveals topological scales in complex networks [J].
Arenas, A ;
Díaz-Guilera, A ;
Pérez-Vicente, CJ .
PHYSICAL REVIEW LETTERS, 2006, 96 (11)
[4]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[5]   Modularity and community detection in bipartite networks [J].
Barber, Michael J. .
PHYSICAL REVIEW E, 2007, 76 (06)
[6]   A scale-free graph model based on bipartite graphs [J].
Birmele, Etienne .
DISCRETE APPLIED MATHEMATICS, 2009, 157 (10) :2267-2284
[7]   The anatomy of a large-scale hypertextual Web search engine [J].
Brin, S ;
Page, L .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117
[8]   Graph structure in the Web [J].
Broder, A ;
Kumar, R ;
Maghoul, F ;
Raghavan, P ;
Rajagopalan, S ;
Stata, R ;
Tomkins, A ;
Wiener, J .
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6) :309-320
[9]   Item-based top-N recommendation algorithms [J].
Deshpande, M ;
Karypis, G .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2004, 22 (01) :143-177
[10]  
Faloutsos M, 1999, COMP COMM R, V29, P251, DOI 10.1145/316194.316229