A Top-N recommendation algorithm based on graph convolutional network that integrates basic user information

Jinling Xu, Ting Wang, Chenjie Su, Zengping Zhang, Xiaodong Cheng
{"title":"A Top-N recommendation algorithm based on graph convolutional network that integrates basic user information","authors":"Jinling Xu, Ting Wang, Chenjie Su, Zengping Zhang, Xiaodong Cheng","doi":"10.1109/ISCEIC53685.2021.00055","DOIUrl":null,"url":null,"abstract":"In order to solve the problem of data sparseness and cold start of the collaborative filtering model, many methods have been proposed, but most of them ignore the user attribute similarity and the user preference. The accuracy of recommendation needs to be improved. Most of researches stay in simple linear modeling of the relationship between users and items, and does not consider the influence of auxiliary information on the recommendation algorithm. In our real life, users preferences are affected by age, gender, and personality. Environment, social circle, etc.In this work, we design a Top-N recommendation algorithm LNGCF-B (light neural graph collaborative filtering with user basic information). Firstly, different from traditional graph convolutional collaborative filtering algorithm, the simplified version is more explanatory, the training time is shortened. Secondly, this algorithm considers the attributes of the user, experiments show that LNGCF-B is better than the baseline algorithm. In our social life, there are many different types of networks, under different network models, the performance of the recommendation algorithm is also different. However, there are few researches on the performance of recommendation algorithms in different scenarios. We use LNGCF-B on two data sets belonging to different network models. The results show that the list recommended by the algorithm on the Movielens 100K data set belonging to the scale-free network has a higher degree of relevance, and the Facebook friend relationship data set belonging to the small world network has a higher recall rate.","PeriodicalId":342968,"journal":{"name":"2021 2nd International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Symposium on Computer Engineering and Intelligent Communications (ISCEIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCEIC53685.2021.00055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In order to solve the problem of data sparseness and cold start of the collaborative filtering model, many methods have been proposed, but most of them ignore the user attribute similarity and the user preference. The accuracy of recommendation needs to be improved. Most of researches stay in simple linear modeling of the relationship between users and items, and does not consider the influence of auxiliary information on the recommendation algorithm. In our real life, users preferences are affected by age, gender, and personality. Environment, social circle, etc.In this work, we design a Top-N recommendation algorithm LNGCF-B (light neural graph collaborative filtering with user basic information). Firstly, different from traditional graph convolutional collaborative filtering algorithm, the simplified version is more explanatory, the training time is shortened. Secondly, this algorithm considers the attributes of the user, experiments show that LNGCF-B is better than the baseline algorithm. In our social life, there are many different types of networks, under different network models, the performance of the recommendation algorithm is also different. However, there are few researches on the performance of recommendation algorithms in different scenarios. We use LNGCF-B on two data sets belonging to different network models. The results show that the list recommended by the algorithm on the Movielens 100K data set belonging to the scale-free network has a higher degree of relevance, and the Facebook friend relationship data set belonging to the small world network has a higher recall rate.
一种集成用户基本信息的基于图卷积网络的Top-N推荐算法
为了解决协同过滤模型的数据稀疏性和冷启动问题,人们提出了许多方法,但大多数方法都忽略了用户属性相似度和用户偏好。推荐的准确性有待提高。大多数研究都停留在简单的用户与商品关系的线性建模上,没有考虑辅助信息对推荐算法的影响。在现实生活中,用户的偏好受到年龄、性别和个性的影响。在本工作中,我们设计了Top-N推荐算法LNGCF-B (light neural graph collaborative filtering with user basic information)。首先,与传统的图卷积协同过滤算法不同,简化版更具解释性,缩短了训练时间。其次,该算法考虑了用户的属性,实验表明LNGCF-B算法优于基线算法。在我们的社会生活中,有很多不同类型的网络,在不同的网络模型下,推荐算法的表现也是不同的。然而,关于推荐算法在不同场景下的性能研究却很少。我们在属于不同网络模型的两个数据集上使用了LNGCF-B。结果表明,算法推荐的列表在属于无尺度网络的Movielens 100K数据集上具有较高的相关度,而属于小世界网络的Facebook好友关系数据集具有较高的召回率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信