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 被引量:111
标识
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 MGCL11We release the codes of MGCL athttps://github.com/hfutmars/MGCL..
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
lou发布了新的文献求助10
刚刚
刚刚
深情安青的应助被腼腆的水蓝采纳,获得10
1秒前
郑方形完成签到,获得积分10
4秒前
4秒前
隐形曼青的应助被zm采纳,获得10
4秒前
4秒前
sun发布了新的文献求助30
4秒前
脑洞疼的应助被maT采纳,获得10
5秒前
愉快的千青完成签到,获得积分20
5秒前
不如吃茶去完成签到,获得积分10
5秒前
香蕉觅云的应助被科研通管家采纳,获得10
6秒前
乐乐的应助被科研通管家采纳,获得30
6秒前
FashionBoy的应助被科研通管家采纳,获得10
6秒前
CodeCraft的应助被科研通管家采纳,获得10
6秒前
FashionBoy的应助被科研通管家采纳,获得10
6秒前
脑洞疼的应助被科研通管家采纳,获得10
6秒前
星星完成签到,获得积分10
6秒前
大个的应助被tomatoGG采纳,获得10
6秒前
我是老大的应助被科研通管家采纳,获得10
6秒前
Owen的应助被科研通管家采纳,获得10
6秒前
桐桐的应助被科研通管家采纳,获得30
7秒前
爆米花的应助被科研通管家采纳,获得10
7秒前
molihuakai的应助被科研通管家采纳,获得10
7秒前
Lucas的应助被科研通管家采纳,获得10
7秒前
合适乐巧发布了新的文献求助10
7秒前
7秒前
7秒前
在水一方的应助被科研通管家采纳,获得10
7秒前
7秒前
大模型的应助被科研通管家采纳,获得10
7秒前
Akim的应助被科研通管家采纳,获得10
7秒前
无花果的应助被科研通管家采纳,获得10
8秒前
李爱国的应助被科研通管家采纳,获得10
8秒前
落纸云烟发布了新的文献求助50
8秒前
晴天完成签到,获得积分10
9秒前
10秒前
10秒前
沉默发布了新的文献求助10
11秒前
MAthor发布了新的文献求助10
11秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
Grapes 1000
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
八旗制度の研究 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8178960
求助须知:如何正确求助?哪些是违规求助? 9569638
关于积分的说明 21805682
捐赠科研通 7774071
什么是DOI,文献DOI怎么找? 3432955
关于科研通互助平台的介绍 2556897
邀请新用户注册赠送积分活动 2478640