An algorithm for friend-recommendation of social networking sites based on SimRank and ant colony optimization

Lian-ju NING, Hai-yan DUAN
{"title":"An algorithm for friend-recommendation of social networking sites based on SimRank and ant colony optimization","authors":"Lian-ju NING,&nbsp;Hai-yan DUAN","doi":"10.1016/S1005-8885(14)60508-2","DOIUrl":null,"url":null,"abstract":"<div><p>We put forward an algorithm on friend-recommendation of social networking sites based on SimRank and ant colony optimization, which broadens the appliance of the algorithm in this academic question. The algorithm focuses on the existing relationships between the members as the initial measurement and constructs artificial ants’ completed routing graph. Finally, an ordered and limited list of personalized recommendations through recursive optimization is produced. In the end, we verify the algorithm's rationality and validity through simulation and the result shows that it can improve the precision of friend-recommendation.</p></div>","PeriodicalId":35359,"journal":{"name":"Journal of China Universities of Posts and Telecommunications","volume":"21 ","pages":"Pages 79-87"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1005-8885(14)60508-2","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of China Universities of Posts and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1005888514605082","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 3

Abstract

We put forward an algorithm on friend-recommendation of social networking sites based on SimRank and ant colony optimization, which broadens the appliance of the algorithm in this academic question. The algorithm focuses on the existing relationships between the members as the initial measurement and constructs artificial ants’ completed routing graph. Finally, an ordered and limited list of personalized recommendations through recursive optimization is produced. In the end, we verify the algorithm's rationality and validity through simulation and the result shows that it can improve the precision of friend-recommendation.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于simmrank和蚁群优化的社交网站好友推荐算法
我们提出了一种基于simmrank和蚁群优化的社交网站好友推荐算法,拓宽了算法在这一学术问题中的应用。该算法以蚁群成员之间存在的关系为初始度量,构建人工蚂蚁的完整路由图。最后,通过递归优化得到有序有限的个性化推荐列表。最后通过仿真验证了算法的合理性和有效性,结果表明该算法可以提高好友推荐的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
0.50
自引率
0.00%
发文量
1878
期刊最新文献
Survey of outdoor and indoor architecture design in TVWS networks Effect of non-spherical atmospheric charged particles and atmospheric visibility on performance of satellite-ground quantum link and parameters simulation Novel high PSRR high-order temperature-compensated subthreshold MOS bandgap reference Anomaly detection in smart grid based on encoder-decoder framework with recurrent neural network Palm vein recognition method based on fusion of local Gabor histograms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1