计算机应用研究2017，Vol.34Issue(4)：1080-1083,4.DOI:10.3969/j.issn.1001-3695.2017.04.028
基于社区划分的多线程潜在好友推荐算法
Multi-thread latent-friendship recommendation based on community detection
摘要
Abstract
This paper proposed multi-thread latent-friendship recommendation algorithm based on community detection (MTFRCD) due to the low running speed of a method for latent-friendship recommendation based on community detection (FRCD).Firstly,MTFRCD figured out kernel sub-networks on network topological diagram by multi-thread technology.Secondly,it regarded kernel sub-networks as seed nodes,the algorithm detected every community structure on network topological diagram by multi-thread paralleling label propagation.At the end,it recommended latent-friendships in all communities.The experiment on artificial network shows MTFRCD maintains performance and elevates running speed notably comparing to traditional method FRCD.Therefore,MTFRCD can apply to the real social network(Scholat.com) to complete latent-friendship recommendation.According to recommendation assessment,MTFRCD is able to achieve a good recommendation.关键词
多线程/社区划分/核心关系子网/标签传播/好友推荐Key words
multi-thread/community detection/kernel sub-network/label propagation/friendship recommendation分类
信息技术与安全科学引用本文复制引用
黄泳航,李春英,汤庸..基于社区划分的多线程潜在好友推荐算法[J].计算机应用研究,2017,34(4):1080-1083,4.基金项目
国家“863”计划资助项目(2013AA01A212) （2013AA01A212）
广州市科技计划资助项目(2014J4300033) （2014J4300033）
2014年广东省重大科技专项资助项目(2014B010116002) （2014B010116002）
广东省自然科学基金资助项目(2015A030310509) （2015A030310509）
国家自然科学基金青年科学基金资助项目(61502180) （61502180）
广东省科技计划资助项目(2015B010109003,2013B0908000024) （2015B010109003,2013B0908000024）
