基于动态进化和图卷积网络的个人推荐图嵌入

Zhihui Wang, Jianrui Chen, Peijie Wang, Tingting Zhu
{"title":"基于动态进化和图卷积网络的个人推荐图嵌入","authors":"Zhihui Wang, Jianrui Chen, Peijie Wang, Tingting Zhu","doi":"10.1109/NaNA53684.2021.00077","DOIUrl":null,"url":null,"abstract":"Graph convolutional network (GCN) and dynamic evolutionary model are the mainstream collaborative filtering technologies in recent years. Nevertheless, the initial feature vectors selection problem of the existing recommendation algorithms based on dynamic evolutionary models leads to unstable recommendation accuracy. In addition, the collaborative filtering method of GCN does not take into account the dynamic evolution law of graph networks. Based on this, this research adopts GCN to train the initial embedding of the dynamic evolution model to perform collaborative filtering recommendation. First of all, a heterogeneous graph network is constructed by applying explicit feedback information (rating scores) of users. Secondly, the embedding of users and items are propagated through the dynamic evolution model. Then, the final embedding is obtained by weighting the embedding of each layer, and the scores are predicted. Finally, according to the Adam optimizer, the initial embedding of the dynamic evolution model is trained in the form of mini-batch to minimize the loss function. Experimental results show that the proposed algorithm is superior to several compared excellent algorithms in recommendation performance.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dyn-GCN: Graph Embedding via Dynamic Evolution and Graph Convolutional Network for Personal Recommendation\",\"authors\":\"Zhihui Wang, Jianrui Chen, Peijie Wang, Tingting Zhu\",\"doi\":\"10.1109/NaNA53684.2021.00077\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph convolutional network (GCN) and dynamic evolutionary model are the mainstream collaborative filtering technologies in recent years. Nevertheless, the initial feature vectors selection problem of the existing recommendation algorithms based on dynamic evolutionary models leads to unstable recommendation accuracy. In addition, the collaborative filtering method of GCN does not take into account the dynamic evolution law of graph networks. Based on this, this research adopts GCN to train the initial embedding of the dynamic evolution model to perform collaborative filtering recommendation. First of all, a heterogeneous graph network is constructed by applying explicit feedback information (rating scores) of users. Secondly, the embedding of users and items are propagated through the dynamic evolution model. Then, the final embedding is obtained by weighting the embedding of each layer, and the scores are predicted. Finally, according to the Adam optimizer, the initial embedding of the dynamic evolution model is trained in the form of mini-batch to minimize the loss function. Experimental results show that the proposed algorithm is superior to several compared excellent algorithms in recommendation performance.\",\"PeriodicalId\":414672,\"journal\":{\"name\":\"2021 International Conference on Networking and Network Applications (NaNA)\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Networking and Network Applications (NaNA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NaNA53684.2021.00077\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA53684.2021.00077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

图卷积网络(GCN)和动态进化模型是近年来主流的协同过滤技术。然而,现有的基于动态进化模型的推荐算法存在初始特征向量选择问题,导致推荐精度不稳定。此外,GCN的协同过滤方法没有考虑图网络的动态演化规律。基于此,本研究采用GCN对动态演化模型初始嵌入进行训练,进行协同过滤推荐。首先,利用用户的显式反馈信息(评分分数)构建异构图网络。其次,通过动态演化模型对用户和项目的嵌入进行传播;然后,对每一层的嵌入值进行加权得到最终的嵌入值,并对得分进行预测。最后,根据Adam优化器,以mini-batch的形式训练动态进化模型的初始嵌入,使损失函数最小化。实验结果表明,该算法在推荐性能上优于几种比较优秀的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dyn-GCN: Graph Embedding via Dynamic Evolution and Graph Convolutional Network for Personal Recommendation
Graph convolutional network (GCN) and dynamic evolutionary model are the mainstream collaborative filtering technologies in recent years. Nevertheless, the initial feature vectors selection problem of the existing recommendation algorithms based on dynamic evolutionary models leads to unstable recommendation accuracy. In addition, the collaborative filtering method of GCN does not take into account the dynamic evolution law of graph networks. Based on this, this research adopts GCN to train the initial embedding of the dynamic evolution model to perform collaborative filtering recommendation. First of all, a heterogeneous graph network is constructed by applying explicit feedback information (rating scores) of users. Secondly, the embedding of users and items are propagated through the dynamic evolution model. Then, the final embedding is obtained by weighting the embedding of each layer, and the scores are predicted. Finally, according to the Adam optimizer, the initial embedding of the dynamic evolution model is trained in the form of mini-batch to minimize the loss function. Experimental results show that the proposed algorithm is superior to several compared excellent algorithms in recommendation performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信