一种兴趣敏感和网络敏感的用户推荐新方法

Yanmin Shang, P. Zhang, Yanan Cao
{"title":"一种兴趣敏感和网络敏感的用户推荐新方法","authors":"Yanmin Shang, P. Zhang, Yanan Cao","doi":"10.1109/NAS.2013.38","DOIUrl":null,"url":null,"abstract":"With the rapid proliferation of diverse online social network sites, user recommendation has been received unprecedented attention. At present, the methods for user recommendation are mainly divided into two categories: recommending a new friend for a target user according to similar interest, or by friendships similarity between the two users. The first category methods have high recall but low precision, the second methods have high precision but low recall. In this paper, we proposed a new hybrid approach by incorporating users' interests and users' friendships together to recommend new friends for target users. Firstly, we use latent Dirichlet allocation (LDA) to model users' interests, and Weighted-PageRank Algorithm to model users' friendship network, and then merge these two factors into a hybrid model based on PageRank algorithm. This hybrid method models users' interests and users' friendships at the same time, and we demonstrate the effectiveness of our hybrid model by using some social network datasets.","PeriodicalId":213334,"journal":{"name":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A New Interest-Sensitive and Network-Sensitive Method for User Recommendation\",\"authors\":\"Yanmin Shang, P. Zhang, Yanan Cao\",\"doi\":\"10.1109/NAS.2013.38\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the rapid proliferation of diverse online social network sites, user recommendation has been received unprecedented attention. At present, the methods for user recommendation are mainly divided into two categories: recommending a new friend for a target user according to similar interest, or by friendships similarity between the two users. The first category methods have high recall but low precision, the second methods have high precision but low recall. In this paper, we proposed a new hybrid approach by incorporating users' interests and users' friendships together to recommend new friends for target users. Firstly, we use latent Dirichlet allocation (LDA) to model users' interests, and Weighted-PageRank Algorithm to model users' friendship network, and then merge these two factors into a hybrid model based on PageRank algorithm. This hybrid method models users' interests and users' friendships at the same time, and we demonstrate the effectiveness of our hybrid model by using some social network datasets.\",\"PeriodicalId\":213334,\"journal\":{\"name\":\"2013 IEEE Eighth International Conference on Networking, Architecture and Storage\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE Eighth International Conference on Networking, Architecture and Storage\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAS.2013.38\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Eighth International Conference on Networking, Architecture and Storage","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAS.2013.38","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

随着各种在线社交网站的迅速涌现,用户推荐受到了前所未有的重视。目前,用户推荐的方法主要分为两大类:根据相似的兴趣为目标用户推荐新朋友,或者根据两个用户之间的友谊相似度推荐新朋友。第一类方法查全率高,查全率低,第二类方法查全率高,查全率低。在本文中,我们提出了一种新的混合方法,将用户的兴趣和用户的友谊结合在一起,为目标用户推荐新朋友。首先利用潜在狄利克雷分配(latent Dirichlet allocation, LDA)对用户的兴趣进行建模,利用加权PageRank算法对用户的友谊网络进行建模,然后将这两个因素合并成基于PageRank算法的混合模型。该混合方法同时对用户兴趣和用户友谊进行建模,并通过一些社交网络数据集验证了混合模型的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Interest-Sensitive and Network-Sensitive Method for User Recommendation
With the rapid proliferation of diverse online social network sites, user recommendation has been received unprecedented attention. At present, the methods for user recommendation are mainly divided into two categories: recommending a new friend for a target user according to similar interest, or by friendships similarity between the two users. The first category methods have high recall but low precision, the second methods have high precision but low recall. In this paper, we proposed a new hybrid approach by incorporating users' interests and users' friendships together to recommend new friends for target users. Firstly, we use latent Dirichlet allocation (LDA) to model users' interests, and Weighted-PageRank Algorithm to model users' friendship network, and then merge these two factors into a hybrid model based on PageRank algorithm. This hybrid method models users' interests and users' friendships at the same time, and we demonstrate the effectiveness of our hybrid model by using some social network datasets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信