不同内隐社会网络对论文推荐的影响

Shaikhah Alotaibi, Julita Vassileva
{"title":"不同内隐社会网络对论文推荐的影响","authors":"Shaikhah Alotaibi, Julita Vassileva","doi":"10.1145/2930238.2930293","DOIUrl":null,"url":null,"abstract":"Combining social network information with collaborative filtering recommendation algorithms has successfully reduced some of the drawbacks of collaborative filtering and increased the accuracy of recommendations. However, all approaches in the domain of research paper recommendation have used explicit social relations that users have initiated which has the problem of low recommendation coverage. We argued that the available data in social bookmarking Web sites such as CiteULike or Mendeley could be exploited to connect similar users using implicit social connections based on their bookmarking behavior. In this paper, we proposed three different implicit social networks-readership, co-readership, and tag-based and we compared the recommendation accuracy of several recommendation algorithms using data from the proposed social networks as input to the recommendation algorithms. Then, we tested which implicit social network provides the best recommendation accuracy. We found that, for the most part, the social recommender is the best algorithm and that the readership network with reciprocal social relations provides the best information source for recommendations but with low coverage. However, the co-readership network provide good recommendation accuracy and better user coverage of recommendation.","PeriodicalId":339100,"journal":{"name":"Proceedings of the 2016 Conference on User Modeling Adaptation and Personalization","volume":"276 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Effect of Different Implicit Social Networks on Recommending Research Papers\",\"authors\":\"Shaikhah Alotaibi, Julita Vassileva\",\"doi\":\"10.1145/2930238.2930293\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Combining social network information with collaborative filtering recommendation algorithms has successfully reduced some of the drawbacks of collaborative filtering and increased the accuracy of recommendations. However, all approaches in the domain of research paper recommendation have used explicit social relations that users have initiated which has the problem of low recommendation coverage. We argued that the available data in social bookmarking Web sites such as CiteULike or Mendeley could be exploited to connect similar users using implicit social connections based on their bookmarking behavior. In this paper, we proposed three different implicit social networks-readership, co-readership, and tag-based and we compared the recommendation accuracy of several recommendation algorithms using data from the proposed social networks as input to the recommendation algorithms. Then, we tested which implicit social network provides the best recommendation accuracy. We found that, for the most part, the social recommender is the best algorithm and that the readership network with reciprocal social relations provides the best information source for recommendations but with low coverage. However, the co-readership network provide good recommendation accuracy and better user coverage of recommendation.\",\"PeriodicalId\":339100,\"journal\":{\"name\":\"Proceedings of the 2016 Conference on User Modeling Adaptation and Personalization\",\"volume\":\"276 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2016 Conference on User Modeling Adaptation and Personalization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2930238.2930293\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2016 Conference on User Modeling Adaptation and Personalization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2930238.2930293","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

将社交网络信息与协同过滤推荐算法相结合,成功地减少了协同过滤的一些缺点,提高了推荐的准确性。然而,研究论文推荐领域的所有方法都使用了用户发起的显式社会关系,这存在推荐覆盖率低的问题。我们认为,可以利用诸如CiteULike或Mendeley等社交书签网站中的可用数据,利用基于书签行为的隐式社会联系来连接相似的用户。在本文中,我们提出了三种不同的隐式社交网络——读者、共同读者和基于标签的社交网络,并使用来自所提出的社交网络的数据作为推荐算法的输入,比较了几种推荐算法的推荐准确性。然后,我们测试了哪种隐式社交网络提供了最好的推荐准确性。我们发现,在大多数情况下,社交推荐是最好的算法,具有互惠社会关系的读者网络为推荐提供了最好的信息源,但覆盖率较低。然而,共同读者网络提供了良好的推荐准确性和更好的推荐用户覆盖率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Effect of Different Implicit Social Networks on Recommending Research Papers
Combining social network information with collaborative filtering recommendation algorithms has successfully reduced some of the drawbacks of collaborative filtering and increased the accuracy of recommendations. However, all approaches in the domain of research paper recommendation have used explicit social relations that users have initiated which has the problem of low recommendation coverage. We argued that the available data in social bookmarking Web sites such as CiteULike or Mendeley could be exploited to connect similar users using implicit social connections based on their bookmarking behavior. In this paper, we proposed three different implicit social networks-readership, co-readership, and tag-based and we compared the recommendation accuracy of several recommendation algorithms using data from the proposed social networks as input to the recommendation algorithms. Then, we tested which implicit social network provides the best recommendation accuracy. We found that, for the most part, the social recommender is the best algorithm and that the readership network with reciprocal social relations provides the best information source for recommendations but with low coverage. However, the co-readership network provide good recommendation accuracy and better user coverage of recommendation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信