亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Multimodal Graph Contrastive Learning for Multimedia-Based Recommendation

计算机科学 图形 情报检索 偏好学习 推荐系统 偏爱 人工智能 自然语言处理 多媒体 人机交互 机器学习 理论计算机科学 经济 微观经济学
作者
Kang Liu,Feng Xue,Dan Guo,Peijie Sun,Shengsheng Qian,Richang Hong
出处
期刊:IEEE Transactions on Multimedia [Institute of Electrical and Electronics Engineers]
卷期号:25: 9343-9355 被引量:62
标识
DOI:10.1109/tmm.2023.3251108
摘要

Multimedia-based recommendation is a challenging task that requires not only learning collaborative signals from user-item interaction, but also capturing modality-specific user interest clues from complex multimedia content. Though significant progress on this challenge has been made, we argue that current solutions remain limited by multimodal noise contamination. Specifically, a considerable proportion of multimedia content is irrelevant to the user preference, such as the background, overall layout, and brightness of images; the word order and semantic-free words in titles; etc . We take this irrelevant information as noise contamination to discover user preferences. Moreover, most recent research has been conducted by graph learning. This means that noise is diffused into the user and item representations with the message propagation; the contamination influence is further amplified. To tackle this problem, we develop a novel framework named Multimodal Graph Contrastive Learning (MGCL), which captures collaborative signals from interactions and uses visual and textual modalities to respectively extract modality-specific user preference clues. The key idea of MGCL involves two aspects: First, to alleviate noise contamination during graph learning, we construct three parallel graph convolution networks to independently generate three types of user and item representations, containing collaborative signals, visual preference clues, and textual preference clues. Second, to eliminate as much preference-independent noisy information as possible from the generated representations, we incorporate sufficient self-supervised signals into the model optimization with the help of contrastive learning, thus enhancing the expressiveness of the user and item representations. Note that MGCL is not limited to graph learning schema, but also can be applied to most matrix factorization methods. We conduct extensive experiments on three public datasets to validate the effectiveness and scalability of MGCL 1 We release the codes of MGCL at https://github.com/hfutmars/MGCL. .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
琳io完成签到 ,获得积分10
2秒前
可爱的函函的应助被犹豫访冬采纳,获得10
9秒前
19秒前
苹果牌牛仔裤完成签到,获得积分10
20秒前
流体工程师完成签到,获得积分10
21秒前
懦弱的绿蝶完成签到,获得积分10
29秒前
分化完成签到 ,获得积分10
30秒前
31秒前
nnnd77发布了新的文献求助10
34秒前
科研通AI6.4的应助被nnnd77采纳,获得10
46秒前
典雅的念梦完成签到,获得积分10
47秒前
1分钟前
Ddddd完成签到 ,获得积分10
1分钟前
传统的金鱼完成签到,获得积分10
1分钟前
Kunning完成签到 ,获得积分0
1分钟前
阔达的泽洋完成签到,获得积分10
1分钟前
1分钟前
qingzx完成签到 ,获得积分10
1分钟前
1分钟前
斯文的访烟完成签到,获得积分10
1分钟前
顺利的访曼完成签到,获得积分10
1分钟前
2分钟前
doranlou完成签到 ,获得积分10
2分钟前
2分钟前
炙热初丹完成签到,获得积分10
2分钟前
无限冰安完成签到,获得积分10
2分钟前
2分钟前
HS完成签到,获得积分10
2分钟前
Tashanzhishi完成签到,获得积分10
2分钟前
热情菲鹰完成签到,获得积分10
2分钟前
小fool完成签到,获得积分10
3分钟前
深情安青的应助被Hzs采纳,获得10
3分钟前
3分钟前
yy完成签到,获得积分10
3分钟前
3分钟前
犹豫访冬发布了新的文献求助10
3分钟前
贺安完成签到 ,获得积分10
3分钟前
打打的应助被科研通管家采纳,获得10
3分钟前
明理紫萍完成签到,获得积分10
3分钟前
yy发布了新的文献求助10
3分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
自動車の空力技術 800
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Issues in Task-Based Language Teaching 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7782599
求助须知:如何正确求助?哪些是违规求助? 9322145
关于积分的说明 20387111
捐赠科研通 7370952
什么是DOI,文献DOI怎么找? 3320428
关于科研通互助平台的介绍 2468277
邀请新用户注册赠送积分活动 2336472