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秒前
舒心的听莲应助1号采纳,获得10
1秒前
2秒前
危莉完成签到 ,获得积分10
3秒前
3秒前
3秒前
优雅访波发布了新的文献求助20
4秒前
科研通AI6.2应助迷人芙蓉采纳,获得10
5秒前
领导范儿应助虚心的月光采纳,获得10
5秒前
秘书发布了新的文献求助30
7秒前
CodeCraft应助HUANG123采纳,获得10
7秒前
shj完成签到,获得积分10
8秒前
Hello应助dde采纳,获得10
8秒前
花花完成签到,获得积分10
9秒前
Tuniverse_完成签到,获得积分10
10秒前
科研通AI6.3应助刻苦从阳采纳,获得10
10秒前
10秒前
12秒前
13秒前
zjj完成签到,获得积分10
13秒前
陶醉延恶发布了新的文献求助10
14秒前
宿帅帅完成签到 ,获得积分10
15秒前
核桃发布了新的文献求助30
17秒前
现实的寄灵完成签到,获得积分10
18秒前
GAW发布了新的文献求助10
18秒前
Orange应助安河桥采纳,获得10
20秒前
20秒前
20秒前
20秒前
slz发布了新的文献求助10
21秒前
天行健完成签到,获得积分10
22秒前
22秒前
22秒前
今后应助yuyu采纳,获得10
23秒前
风中谷南完成签到,获得积分10
24秒前
24秒前
在水一方应助凶狠的牛排采纳,获得10
24秒前
A_Caterpillar完成签到,获得积分10
24秒前
25秒前
科研通AI6.4应助张琪采纳,获得10
25秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 2000
Weaponeering: An Introduction Fourth Edition, Volume 1 1000
Advanced Weaponeering Fourth Edition, Volume 2 1000
Curating Socialism: A Handbook of International Art Exhibitions 1947-1989 750
悉尼大学博士学位论文,题目:Modelling and testing of one-sided stitched laminated composites. 作者:Kristopher P. Plain 700
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7526925
求助须知:如何正确求助?哪些是违规求助? 9113375
关于积分的说明 19464233
捐赠科研通 7128986
什么是DOI,文献DOI怎么找? 3255776
关于科研通互助平台的介绍 2423573
邀请新用户注册赠送积分活动 2243205