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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
121212完成签到,获得积分20
刚刚
更深的蓝完成签到,获得积分10
2秒前
英姑的应助被陈少华采纳,获得10
2秒前
赘婿的应助被牛鑫晨采纳,获得50
2秒前
3秒前
3秒前
超级天晴完成签到,获得积分10
3秒前
长满头发的秃子完成签到 ,获得积分10
4秒前
低位发布了新的文献求助10
4秒前
yang发布了新的文献求助20
5秒前
FashionBoy的应助被xaogny采纳,获得10
5秒前
上下文发布了新的文献求助10
5秒前
Mark完成签到,获得积分10
5秒前
我只想放假完成签到,获得积分10
5秒前
老虎油发布了新的文献求助10
5秒前
6秒前
李健的应助被温暖海亦采纳,获得10
6秒前
崔晴晴发布了新的文献求助10
6秒前
6秒前
bfz50发布了新的文献求助10
7秒前
犹豫怡发布了新的文献求助10
7秒前
领导范儿的应助被zhy采纳,获得30
7秒前
8秒前
9秒前
9秒前
坚强且66完成签到,获得积分10
10秒前
10秒前
22553完成签到,获得积分10
10秒前
孟斯扬完成签到,获得积分10
11秒前
番茄加菲发布了新的文献求助20
11秒前
谨慎鞅发布了新的文献求助10
11秒前
aa完成签到,获得积分10
11秒前
小巧静竹完成签到,获得积分10
12秒前
aajhajkahna的应助被科研通管家采纳,获得10
12秒前
Owen的应助被科研通管家采纳,获得10
12秒前
蒸鱼鱼的应助被科研通管家采纳,获得10
12秒前
XX的应助被科研通管家采纳,获得10
12秒前
12秒前
yue4yue发布了新的文献求助10
12秒前
wanci的应助被科研通管家采纳,获得10
12秒前
高分求助中
(应助此贴封号)通过应助OA文献获取积分 10000
Organizational Behavior 510
A Silent Apostrophe:The Fayum Portraits 350
Sing with Understanding: Introduction to Theology in Christian Congregational Song, 3rd ed 330
Auslegung und Untersuchung einer invers ausgelegten Beschaufelung eines einstufigen Axialverdichters mit Vorleitrad (German) 300
AI-Contracting 300
四川大学学位论文.郭瑞昂. 基于高压热扩散的n型磷掺杂金刚石半导体制备研究 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 计算机科学 工程类 纳米技术 有机化学 化学工程 内科学 物理 生物化学 复合材料 催化作用 细胞生物学 人工智能 心理学 无机化学 基因 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 7839749
求助须知:如何正确求助?哪些是违规求助? 9361654
关于积分的说明 20621897
捐赠科研通 7434081
什么是DOI,文献DOI怎么找? 3339376
关于科研通互助平台的介绍 2483778
邀请新用户注册赠送积分活动 2360992