基于强连通邻域采样的电影推荐系统

Jatmiko Budi Baskoro, E. Yulianti
{"title":"基于强连通邻域采样的电影推荐系统","authors":"Jatmiko Budi Baskoro, E. Yulianti","doi":"10.21609/jiki.v15i1.1066","DOIUrl":null,"url":null,"abstract":"User and item embeddings are key resources for the development of recommender systems. Recent works has exploited connectivity between users and items in graphs to incorporate the preferences of local neighborhoods into embeddings. Information inferred from graph connections is very useful, especially when interaction between user and item is sparse. In this paper, we propose graphSAGE Collaborative Filtering (SGCF), an inductive graph-based recommendation system with local sampling weight. We conducted an experiment to investigate recommendation performance for SGCF by comparing its performance with baseline and several SGCF variants in Movielens dataset, which are commonly used as recommendation system benchmark data. Our experiment shows that weighted SGCF perform 0.5% higher than benchmark in NDCG@5 and NDCG@10, and 0.8% in NDCG@100. Weighted SGCF perform 0.79% higher than benchmark in recall@5, 0.4% increase for recall@10 and 1.85% increase for recall@100. All the improvements are statistically significant with p-value 0.05.","PeriodicalId":31392,"journal":{"name":"Jurnal Ilmu Komputer dan Informasi","volume":"37 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SGCF: Inductive Movie Recommendation System with Strongly Connected Neighborhood Sampling\",\"authors\":\"Jatmiko Budi Baskoro, E. Yulianti\",\"doi\":\"10.21609/jiki.v15i1.1066\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"User and item embeddings are key resources for the development of recommender systems. Recent works has exploited connectivity between users and items in graphs to incorporate the preferences of local neighborhoods into embeddings. Information inferred from graph connections is very useful, especially when interaction between user and item is sparse. In this paper, we propose graphSAGE Collaborative Filtering (SGCF), an inductive graph-based recommendation system with local sampling weight. We conducted an experiment to investigate recommendation performance for SGCF by comparing its performance with baseline and several SGCF variants in Movielens dataset, which are commonly used as recommendation system benchmark data. Our experiment shows that weighted SGCF perform 0.5% higher than benchmark in NDCG@5 and NDCG@10, and 0.8% in NDCG@100. Weighted SGCF perform 0.79% higher than benchmark in recall@5, 0.4% increase for recall@10 and 1.85% increase for recall@100. All the improvements are statistically significant with p-value 0.05.\",\"PeriodicalId\":31392,\"journal\":{\"name\":\"Jurnal Ilmu Komputer dan Informasi\",\"volume\":\"37 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Jurnal Ilmu Komputer dan Informasi\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21609/jiki.v15i1.1066\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Ilmu Komputer dan Informasi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21609/jiki.v15i1.1066","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

用户和条目嵌入是开发推荐系统的关键资源。最近的工作是利用用户和物品之间的连通性,将当地社区的偏好纳入嵌入。从图连接中推断出的信息非常有用,特别是当用户和项目之间的交互是稀疏的时候。本文提出了一种基于局部采样权的基于归纳图的推荐系统graphSAGE协同过滤(SGCF)。我们通过将SGCF的性能与基线和Movielens数据集中的几个SGCF变体进行比较,研究了SGCF的推荐性能,这些数据通常用作推荐系统的基准数据。我们的实验表明,加权SGCF在NDCG@5和NDCG@10上的性能比基准高0.5%,在NDCG@100上的性能比基准高0.8%。加权SGCF在recall@5比基准高0.79%,recall@10比基准高0.4%,recall@100比基准高1.85%。所有改善均有统计学意义,p值为0.05。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SGCF: Inductive Movie Recommendation System with Strongly Connected Neighborhood Sampling
User and item embeddings are key resources for the development of recommender systems. Recent works has exploited connectivity between users and items in graphs to incorporate the preferences of local neighborhoods into embeddings. Information inferred from graph connections is very useful, especially when interaction between user and item is sparse. In this paper, we propose graphSAGE Collaborative Filtering (SGCF), an inductive graph-based recommendation system with local sampling weight. We conducted an experiment to investigate recommendation performance for SGCF by comparing its performance with baseline and several SGCF variants in Movielens dataset, which are commonly used as recommendation system benchmark data. Our experiment shows that weighted SGCF perform 0.5% higher than benchmark in NDCG@5 and NDCG@10, and 0.8% in NDCG@100. Weighted SGCF perform 0.79% higher than benchmark in recall@5, 0.4% increase for recall@10 and 1.85% increase for recall@100. All the improvements are statistically significant with p-value 0.05.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
审稿时长
4 weeks
×
引用
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学术官方微信