Interest-Aware Content Discovery in Peer-to-Peer Social Networks

被引:18
作者
Guo, Yonghong [1 ,2 ]
Liu, Lu [3 ]
Wu, Yan [2 ]
Hardy, James [3 ]
机构
[1] Jiangsu Univ, Changzhou Coll Informat Technol, Zhenjiang, Peoples R China
[2] Jiangsu Univ, Sch Comp Sci & Telecommun Engn, Zhenjiang, Peoples R China
[3] Univ Derby, Dept Elect Comp & Math, Derby, England
基金
中国国家自然科学基金;
关键词
Online Social Networks; content discovery; self-organization; SMALL-WORLD; INFORMATION;
D O I
10.1145/3176247
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the increasing popularity and rapid development of Online Social Networks (OSNs), OSNs not only bring fundamental changes to information and communication technologies, but also make an extensive and profound impact on all aspects of our social life. Efficient content discovery is a fundamental challenge for large-scale distributed OSNs. However, the similarity between social networks and online social networks leads us to believe that the existing social theories are useful for improving the performance of social content discovery in online social networks. In this article, we propose an interest-aware social-like peer-to-peer (IASLP) model for social content discovery in OSNs by mimicking ten different social theories and strategies. In the IASLP network, network nodes with similar interests can meet, help each other, and co-operate autonomously to identify useful contents. The presented model has been evaluated and simulated in a dynamic environment with an evolving network. The experimental results show that the recall of IASLP is 20% higher than the existing method SESD while the overhead is 10% lower. The IASLP can generate higher flexibility and adaptability and achieve better performance than the existing methods.
引用
收藏
页数:21
相关论文
共 38 条
[1]  
[Anonymous], 2013, OLFACTORY FATIGUE
[2]  
[Anonymous], 2016, OPEN DIRECTORY PROJE
[3]   Emergence of scaling in random networks [J].
Barabási, AL ;
Albert, R .
SCIENCE, 1999, 286 (5439) :509-512
[4]   Peer-to-Peer Content Sharing Based on Social Identities and Relationships [J].
Bellavista, Paolo ;
Giannelli, Carlo ;
Iannario, Luca ;
Goix, Laurent-Walter ;
Venezia, Claudio .
IEEE INTERNET COMPUTING, 2014, 18 (03) :55-63
[5]  
Bhagwan R, 2003, LECT NOTES COMPUT SC, V2735, P256
[6]   A taxonomy of decentralized online social networks [J].
Chowdhury, Shihabur Rahman ;
Roy, Arup Raton ;
Shaikh, Maheen ;
Daudjee, Khuzaima .
PEER-TO-PEER NETWORKING AND APPLICATIONS, 2015, 8 (03) :367-383
[7]   The role of attention in the development of short-term memory: Age differences in the verbal span of apprehension [J].
Cowan, N ;
Nugent, LD ;
Elliott, EM ;
Ponomarev, I ;
Saults, JS .
CHILD DEVELOPMENT, 1999, 70 (05) :1082-1097
[8]   Routing indices for peer-to-peer systems [J].
Crespo, A ;
Garcia-Molina, H .
22ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2002, :23-32
[9]   INFORMATION-PROCESSING INTERPRETATION OF ERRORS IN COLLEGE SCIENCE LEARNING [J].
FISHER, KM ;
LIPSON, JI .
INSTRUCTIONAL SCIENCE, 1985, 14 (01) :49-74
[10]  
Guidi Barbara, 2013, 2013 International Conference on High Performance Computing & Simulation (HPCS), P678, DOI 10.1109/HPCSim.2013.6641493