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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
景飞丹发布了新的文献求助10
2秒前
Tong123发布了新的文献求助10
3秒前
渐变映射发布了新的文献求助30
3秒前
Karl发布了新的文献求助10
3秒前
Boy_h完成签到,获得积分20
3秒前
可爱的函函应助皓月采纳,获得10
4秒前
5秒前
5秒前
好运时间完成签到 ,获得积分10
6秒前
8秒前
Hon发布了新的文献求助30
8秒前
飞飞完成签到,获得积分10
8秒前
呢喃发布了新的文献求助10
9秒前
11秒前
rous完成签到,获得积分20
11秒前
科研通AI6.4应助好运小陈采纳,获得10
12秒前
12秒前
13秒前
14秒前
刘议遥完成签到,获得积分10
14秒前
14秒前
英姑应助Tong123采纳,获得10
14秒前
天天快乐应助可闲采纳,获得10
14秒前
聪明的小乌龟完成签到,获得积分10
17秒前
dajiejie发布了新的文献求助10
17秒前
singber完成签到,获得积分10
17秒前
高小航发布了新的文献求助10
17秒前
17秒前
18秒前
18秒前
18秒前
zsl发布了新的文献求助30
19秒前
19秒前
19秒前
晨宸完成签到,获得积分10
19秒前
19秒前
书枫哥哥发布了新的文献求助10
19秒前
CC完成签到,获得积分10
21秒前
21秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
China Pluperfect I: Epistemology of Past and Outside in Chinese Art 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Governing Growth: Us Industrial Policy from Hamilton to Trump 500
The fast track to determining transfer functions of linear circuits: The student guide 500
The Analytical and Numerical Solution of Electric and Magnetic Fields 500
Synthesis of P-Chiral Phosphine Ligands and Their Applications in Asymmetric Catalysis 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7625443
求助须知:如何正确求助?哪些是违规求助? 9200374
关于积分的说明 19725814
捐赠科研通 7196376
什么是DOI,文献DOI怎么找? 3273697
关于科研通互助平台的介绍 2435841
邀请新用户注册赠送积分活动 2269522