Recommendation Ranking Method Combining Graph Convolutional Network and Factorization Machine

Jing Yu, Wenhai Liu, Mingxing Zhou, Yunwen Chen, Daqi Ji, Na Sai
{"title":"Recommendation Ranking Method Combining Graph Convolutional Network and Factorization Machine","authors":"Jing Yu, Wenhai Liu, Mingxing Zhou, Yunwen Chen, Daqi Ji, Na Sai","doi":"10.1109/ICWOC55996.2022.9809884","DOIUrl":null,"url":null,"abstract":"With the rapid development of graph neural network technology and the wide application of personalized recommender systems in the industry, how to better apply graph representation learning to recommender systems to continuously improve the recommendation effect and improve the user experience has become a hot field of the industry research. Based on hot issues such as sparse feature data, cold start, and multi-feature combination in massive data, this paper proposes a personalized recommendation ranking method that combines graph convolutional network and factorization machine. The method represents the network relationship between users and items based on the graph structure and generates the graph embeddings on the hyperparameter space through graph representation learning, uses the factorization machine to combine the learning of four categories of features of user attributes, item attributes, interaction, and context, and generates the vector representation separately, and finally predicts personalized recommendation score based on the ranking model. The comparison experiments of multiple groups of ranking methods show that the ranking learning method proposed in this paper is better than the baseline in six indicators of AUC, Logloss, UV_CTR, CVR, ATV and the exposure ratio of new items on the online e-commerce data set, which proves the effectiveness of the proposed method.","PeriodicalId":402416,"journal":{"name":"2022 10th International Conference on Intelligent Computing and Wireless Optical Communications (ICWOC)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 10th International Conference on Intelligent Computing and Wireless Optical Communications (ICWOC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWOC55996.2022.9809884","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid development of graph neural network technology and the wide application of personalized recommender systems in the industry, how to better apply graph representation learning to recommender systems to continuously improve the recommendation effect and improve the user experience has become a hot field of the industry research. Based on hot issues such as sparse feature data, cold start, and multi-feature combination in massive data, this paper proposes a personalized recommendation ranking method that combines graph convolutional network and factorization machine. The method represents the network relationship between users and items based on the graph structure and generates the graph embeddings on the hyperparameter space through graph representation learning, uses the factorization machine to combine the learning of four categories of features of user attributes, item attributes, interaction, and context, and generates the vector representation separately, and finally predicts personalized recommendation score based on the ranking model. The comparison experiments of multiple groups of ranking methods show that the ranking learning method proposed in this paper is better than the baseline in six indicators of AUC, Logloss, UV_CTR, CVR, ATV and the exposure ratio of new items on the online e-commerce data set, which proves the effectiveness of the proposed method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
结合图卷积网络和分解机的推荐排序方法
随着图神经网络技术的快速发展和个性化推荐系统在行业中的广泛应用,如何更好地将图表示学习应用到推荐系统中,不断提高推荐效果,改善用户体验,成为行业研究的热点领域。针对海量数据中特征数据稀疏、冷启动、多特征组合等热点问题,提出了一种结合图卷积网络和分解机的个性化推荐排序方法。该方法基于图结构表示用户与物品之间的网络关系,并通过图表示学习在超参数空间上生成图嵌入,利用分解机将用户属性、物品属性、交互、上下文四类特征的学习结合起来,分别生成向量表示,最后基于排名模型预测个性化推荐分数。多组排序方法的对比实验表明,本文提出的排序学习方法在AUC、Logloss、UV_CTR、CVR、ATV以及新商品在在线电子商务数据集上的曝光率等6个指标上均优于基线,证明了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
FPGA Based Traffic Sign Detection Using Support Vector Machine and Hybrid Filters A Physical-Layer Collision Awared All-Optical Time Slice Routing Optimization Method for High Reliable Low-Latency Communication in Transmission and Computing Resource Integration Networks Analysis and Research of Information Collection Method Based on Penetration Test Machine Learning Based Channel Estimation Optimization for OFDM Communication Systems Wireless Channel Estimation in Shipbuilding Scenario Based on Reconfigurable Intelligent Surface
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1