Using composite attribute similarity multi-graph convolutional network for recommendation

IF 3.5 2区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Weichao He, Yi Zhu, Mei Song, Yuheng Su, Guosheng Hao
{"title":"Using composite attribute similarity multi-graph convolutional network for recommendation","authors":"Weichao He,&nbsp;Yi Zhu,&nbsp;Mei Song,&nbsp;Yuheng Su,&nbsp;Guosheng Hao","doi":"10.1007/s10489-025-06840-4","DOIUrl":null,"url":null,"abstract":"<div><p>Graph Convolutional Networks (GCNs) are frequently utilized and havel a significant role in recommender systems. This is attributed to their ability to capture signals of collaboration between higher-order neighbors using graph structures. GCN-based recommendation models have been greatly improved in improving recommendation performance, but continue to face serious data sparsity problems. Data sparsity can be effectively alleviated by introducing attribute information. However, current GCN-based models face challenges in effectively handling the diverse attribute information of users and items and capturing the complex relationships among users, items, and attributes. With the purpose of addressing aforementioned problems, this research proposes a Using Composite Attribute Similarity Multi-Graph Convolutional Network (UCASM-GCN) for recommendation. In concrete terms, an attribute fusion strategy based on the attention mechanism is first utilized to construct the composite attributes of users or items. Then, the user-user graph and the item-item graph are constructed using the composite attributes of nodes to mine the relationships between users and between items. Finally, two isomorphic graphs are injected into the user-item interaction graph as auxiliary information through a multi-graph convolution strategy to generate optimized embedding representations, which ultimately improve the recommendation performance. Extensive experiments on three public datasets demonstrate the effectiveness of the proposed UCASM-GCN, achieving performance gains of 2.48%, 8.20% and 5.52% over a competitive graph-based collaborative filtering model on the Movielens 100k, Movielens 1M and DoubanBook datasets, respectively.</p></div>","PeriodicalId":8041,"journal":{"name":"Applied Intelligence","volume":"55 14","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2025-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10489-025-06840-4","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Graph Convolutional Networks (GCNs) are frequently utilized and havel a significant role in recommender systems. This is attributed to their ability to capture signals of collaboration between higher-order neighbors using graph structures. GCN-based recommendation models have been greatly improved in improving recommendation performance, but continue to face serious data sparsity problems. Data sparsity can be effectively alleviated by introducing attribute information. However, current GCN-based models face challenges in effectively handling the diverse attribute information of users and items and capturing the complex relationships among users, items, and attributes. With the purpose of addressing aforementioned problems, this research proposes a Using Composite Attribute Similarity Multi-Graph Convolutional Network (UCASM-GCN) for recommendation. In concrete terms, an attribute fusion strategy based on the attention mechanism is first utilized to construct the composite attributes of users or items. Then, the user-user graph and the item-item graph are constructed using the composite attributes of nodes to mine the relationships between users and between items. Finally, two isomorphic graphs are injected into the user-item interaction graph as auxiliary information through a multi-graph convolution strategy to generate optimized embedding representations, which ultimately improve the recommendation performance. Extensive experiments on three public datasets demonstrate the effectiveness of the proposed UCASM-GCN, achieving performance gains of 2.48%, 8.20% and 5.52% over a competitive graph-based collaborative filtering model on the Movielens 100k, Movielens 1M and DoubanBook datasets, respectively.

采用复合属性相似度多图卷积网络进行推荐
图卷积网络(GCNs)在推荐系统中被广泛使用并发挥着重要作用。这是由于它们能够利用图结构捕捉高阶邻居之间的协作信号。基于gcn的推荐模型在提高推荐性能方面有了很大的进步,但仍然面临着严重的数据稀疏性问题。通过引入属性信息,可以有效地缓解数据稀疏性。然而,当前基于gcn的模型在有效处理用户和物品的多样化属性信息以及捕获用户、物品和属性之间的复杂关系方面面临挑战。为了解决上述问题,本研究提出了一种使用复合属性相似度多图卷积网络(UCASM-GCN)进行推荐。具体而言,首先利用基于注意机制的属性融合策略构建用户或物品的复合属性。然后,利用节点的复合属性构造用户-用户图和项-项图,挖掘用户之间和项之间的关系。最后,通过多图卷积策略将两个同构图作为辅助信息注入到用户-物品交互图中,生成优化的嵌入表示,最终提高推荐性能。在三个公共数据集上的大量实验证明了所提出的UCASM-GCN的有效性,在Movielens 100k、Movielens 1M和豆瓣书数据集上,与竞争性的基于图的协同过滤模型相比,其性能分别提高了2.48%、8.20%和5.52%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Applied Intelligence
Applied Intelligence 工程技术-计算机:人工智能
CiteScore
6.60
自引率
20.80%
发文量
1361
审稿时长
5.9 months
期刊介绍: With a focus on research in artificial intelligence and neural networks, this journal addresses issues involving solutions of real-life manufacturing, defense, management, government and industrial problems which are too complex to be solved through conventional approaches and require the simulation of intelligent thought processes, heuristics, applications of knowledge, and distributed and parallel processing. The integration of these multiple approaches in solving complex problems is of particular importance. The journal presents new and original research and technological developments, addressing real and complex issues applicable to difficult problems. It provides a medium for exchanging scientific research and technological achievements accomplished by the international community.
×
引用
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学术官方微信