基于混合特征的社交网络系统好友推荐方法

R. Yadav, Shashi Prakash Tripathi, A. K. Rai, R. Tewari
{"title":"基于混合特征的社交网络系统好友推荐方法","authors":"R. Yadav, Shashi Prakash Tripathi, A. K. Rai, R. Tewari","doi":"10.1504/ijwbc.2020.10024150","DOIUrl":null,"url":null,"abstract":"Link prediction is an effective technique to be applied on graph-based models due to its wide range of applications. It helps to understand associations between nodes in social communities. The social networking systems use link prediction techniques to recommend new friends to their users. In this paper, we design two time efficient algorithms for finding all paths of length-2 and length-3 between every pair of vertices in a network which are further used in computation of final similarity scores in the proposed method. Further, we define a hybrid feature-based node similarity measure for link prediction that captures both local and global graph features. The designed similarity measure provides friend recommendations by traversing only paths of limited length, which causes more faster and accurate friend recommendations. Experimental results show adequate level of accuracy in friend recommendations within considerable computing time.","PeriodicalId":39041,"journal":{"name":"International Journal of Web Based Communities","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Hybrid Feature Based Approach for Recommending Friends in Social Networking Systems\",\"authors\":\"R. Yadav, Shashi Prakash Tripathi, A. K. Rai, R. Tewari\",\"doi\":\"10.1504/ijwbc.2020.10024150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Link prediction is an effective technique to be applied on graph-based models due to its wide range of applications. It helps to understand associations between nodes in social communities. The social networking systems use link prediction techniques to recommend new friends to their users. In this paper, we design two time efficient algorithms for finding all paths of length-2 and length-3 between every pair of vertices in a network which are further used in computation of final similarity scores in the proposed method. Further, we define a hybrid feature-based node similarity measure for link prediction that captures both local and global graph features. The designed similarity measure provides friend recommendations by traversing only paths of limited length, which causes more faster and accurate friend recommendations. Experimental results show adequate level of accuracy in friend recommendations within considerable computing time.\",\"PeriodicalId\":39041,\"journal\":{\"name\":\"International Journal of Web Based Communities\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Web Based Communities\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijwbc.2020.10024150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"Social Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Web Based Communities","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijwbc.2020.10024150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Social Sciences","Score":null,"Total":0}
引用次数: 1

摘要

链路预测是一种应用于基于图的模型的有效技术,具有广泛的应用前景。它有助于理解社会群体中节点之间的联系。社交网络系统使用链接预测技术向用户推荐新朋友。在本文中,我们设计了两种时间效率高的算法来寻找网络中每对顶点之间长度为2和长度为3的所有路径,并将其进一步用于计算最终的相似度得分。此外,我们定义了一种基于混合特征的节点相似度度量,用于捕获局部和全局图特征的链接预测。所设计的相似性度量通过只遍历有限长度的路径来提供朋友推荐,从而获得更快和更准确的朋友推荐。实验结果表明,在相当长的计算时间内,好友推荐具有足够的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Hybrid Feature Based Approach for Recommending Friends in Social Networking Systems
Link prediction is an effective technique to be applied on graph-based models due to its wide range of applications. It helps to understand associations between nodes in social communities. The social networking systems use link prediction techniques to recommend new friends to their users. In this paper, we design two time efficient algorithms for finding all paths of length-2 and length-3 between every pair of vertices in a network which are further used in computation of final similarity scores in the proposed method. Further, we define a hybrid feature-based node similarity measure for link prediction that captures both local and global graph features. The designed similarity measure provides friend recommendations by traversing only paths of limited length, which causes more faster and accurate friend recommendations. Experimental results show adequate level of accuracy in friend recommendations within considerable computing time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Web Based Communities
International Journal of Web Based Communities Social Sciences-Communication
CiteScore
2.00
自引率
0.00%
发文量
30
期刊最新文献
Exploring the impact of COVID-19 Pandemic and Vaccine Dissemination on Airbnb's Popularity and Sentiment on Twitter Decision making method of e-consumption behavior and attitude based on social network trust model Study on Network marketing service resource allocation based on social media platform An online social network image retrieval using deep belief network An evolution trend evaluation of social media network public opinion based on unsupervised learning
×
引用
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