GroupMO: a memory-augmented meta-optimized model for group recommendation

Jiawei Hong, Wen Yang, Pingfu Chao, Junhua Fang
{"title":"GroupMO: a memory-augmented meta-optimized model for group recommendation","authors":"Jiawei Hong, Wen Yang, Pingfu Chao, Junhua Fang","doi":"10.1007/s11280-024-01267-2","DOIUrl":null,"url":null,"abstract":"<p>Group recommendation aims to suggest desired items for a group of users. Existing methods can achieve inspiring results in predicting the group preferences in data-rich groups. However, they could be ineffective in supporting cold-start groups due to their sparsity interactions, which prevents the model from understanding their intent. Although cold-start groups can be alleviated by meta-learning, we cannot apply it by using the same initialization for all groups due to their varying preferences. To tackle this problem, this paper proposes a memory-augmented meta-optimized model for group recommendation, namely GroupMO. Specifically, we adopt a clustering method to assemble the groups with similar profiles into the same cluster and design a representative group profile memory to guide the preliminary initialization of group embedding network for each group by utilizing those clusters. Besides, we also design a group shared preference memory to guide the prediction network initialization at a more refined granularity level for different groups, so that the shared knowledge can be better transferred to groups with similar preferences. Moreover, we incorporate those two memories to optimize the meta-learning process. Finally, extensive experiments on two real-world datasets demonstrate the superiority of our model.</p>","PeriodicalId":501180,"journal":{"name":"World Wide Web","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Wide Web","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s11280-024-01267-2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Group recommendation aims to suggest desired items for a group of users. Existing methods can achieve inspiring results in predicting the group preferences in data-rich groups. However, they could be ineffective in supporting cold-start groups due to their sparsity interactions, which prevents the model from understanding their intent. Although cold-start groups can be alleviated by meta-learning, we cannot apply it by using the same initialization for all groups due to their varying preferences. To tackle this problem, this paper proposes a memory-augmented meta-optimized model for group recommendation, namely GroupMO. Specifically, we adopt a clustering method to assemble the groups with similar profiles into the same cluster and design a representative group profile memory to guide the preliminary initialization of group embedding network for each group by utilizing those clusters. Besides, we also design a group shared preference memory to guide the prediction network initialization at a more refined granularity level for different groups, so that the shared knowledge can be better transferred to groups with similar preferences. Moreover, we incorporate those two memories to optimize the meta-learning process. Finally, extensive experiments on two real-world datasets demonstrate the superiority of our model.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GroupMO:用于群体推荐的内存增强元优化模型
群体推荐旨在为一组用户推荐所需的项目。现有的方法可以在预测数据丰富的群体偏好方面取得令人鼓舞的结果。然而,由于冷启动群组的稀疏交互,模型无法理解其意图,因此这些方法无法有效支持冷启动群组。虽然元学习可以缓解冷启动群组的问题,但由于所有群组的偏好各不相同,我们无法对所有群组使用相同的初始化。为了解决这个问题,本文提出了一种用于群体推荐的内存增强元优化模型,即 GroupMO。具体来说,我们采用聚类方法将具有相似特征的群体归入同一聚类,并设计一个具有代表性的群体特征存储器,利用这些聚类指导每个群体嵌入网络的初步初始化。此外,我们还设计了一个群体共享偏好存储器,以指导不同群体在更精细的粒度水平上进行预测网络初始化,从而将共享知识更好地传递给具有相似偏好的群体。此外,我们还整合了这两个存储器,以优化元学习过程。最后,在两个真实世界数据集上进行的大量实验证明了我们模型的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
HetFS: a method for fast similarity search with ad-hoc meta-paths on heterogeneous information networks A SHAP-based controversy analysis through communities on Twitter pFind: Privacy-preserving lost object finding in vehicular crowdsensing Use of prompt-based learning for code-mixed and code-switched text classification Drug traceability system based on semantic blockchain and on a reputation method
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1