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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
sherif完成签到,获得积分10
刚刚
刚刚
Kins完成签到,获得积分10
刚刚
ffw1发布了新的文献求助10
1秒前
1秒前
Ethan完成签到,获得积分10
1秒前
眼睛大的寄真完成签到,获得积分10
1秒前
hezi完成签到,获得积分10
1秒前
RR发布了新的文献求助10
1秒前
传奇3应助幽歌者无我采纳,获得10
2秒前
乐乐应助冷晴采纳,获得10
2秒前
2秒前
2秒前
2秒前
pxl99567发布了新的文献求助10
2秒前
佳银完成签到,获得积分10
3秒前
Twonej应助neckerzhu采纳,获得30
3秒前
无极微光应助我要瘦采纳,获得20
4秒前
冬虫夏草完成签到,获得积分10
4秒前
赫尔海发布了新的文献求助10
4秒前
5秒前
斯文败类应助科研通管家采纳,获得10
5秒前
汉堡包应助科研通管家采纳,获得10
5秒前
SciGPT应助科研通管家采纳,获得10
5秒前
充电宝应助科研通管家采纳,获得10
5秒前
Lucas应助科研通管家采纳,获得10
5秒前
Twonej应助科研通管家采纳,获得30
5秒前
完美世界应助科研通管家采纳,获得10
5秒前
彭于晏应助科研通管家采纳,获得10
5秒前
goldenfleece完成签到,获得积分10
5秒前
爆米花应助科研通管家采纳,获得10
5秒前
zhonglv7应助科研通管家采纳,获得10
5秒前
6秒前
KDVBHGJDFHGAV应助科研通管家采纳,获得10
6秒前
6秒前
aeiou完成签到,获得积分10
6秒前
Twonej应助科研通管家采纳,获得30
6秒前
天天快乐应助科研通管家采纳,获得10
6秒前
海蓝云天应助科研通管家采纳,获得10
6秒前
pluto应助科研通管家采纳,获得10
6秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Burger's Medicinal Chemistry, Drug Discovery and Development, Volumes 1 - 8, 8 Volume Set, 8th Edition 1800
Cronologia da história de Macau 1600
Contemporary Debates in Epistemology (3rd Edition) 1000
International Arbitration Law and Practice 1000
文献PREDICTION EQUATIONS FOR SHIPS' TURNING CIRCLES或期刊Transactions of the North East Coast Institution of Engineers and Shipbuilders第95卷 1000
BRITTLE FRACTURE IN WELDED SHIPS 1000
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 纳米技术 计算机科学 化学工程 生物化学 物理 复合材料 内科学 催化作用 物理化学 光电子学 细胞生物学 基因 电极 遗传学
热门帖子
关注 科研通微信公众号,转发送积分 6159794
求助须知:如何正确求助?哪些是违规求助? 7987960
关于积分的说明 16602496
捐赠科研通 5268201
什么是DOI,文献DOI怎么找? 2810869
邀请新用户注册赠送积分活动 1791001
关于科研通互助平台的介绍 1658101