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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
丫丫完成签到 ,获得积分10
1秒前
SuperTao发布了新的文献求助10
2秒前
桐桐应助长情爆米花采纳,获得10
2秒前
4秒前
lx应助科研通管家采纳,获得10
4秒前
yyds完成签到,获得积分0
7秒前
天真南松完成签到,获得积分10
7秒前
芭乐王子完成签到 ,获得积分10
9秒前
研友_VZG7GZ应助姜丝罐罐n采纳,获得10
11秒前
昏睡的静丹完成签到,获得积分10
11秒前
hoy完成签到 ,获得积分10
12秒前
12秒前
pick_up完成签到,获得积分10
15秒前
研友_24789完成签到,获得积分10
17秒前
kyokyoro完成签到,获得积分10
17秒前
17秒前
健忘青牛完成签到 ,获得积分10
18秒前
扯淡儿完成签到 ,获得积分10
18秒前
等待冰之完成签到 ,获得积分10
18秒前
Lockie完成签到 ,获得积分10
19秒前
茹乂完成签到 ,获得积分10
21秒前
怕孤独的迎梦完成签到 ,获得积分10
22秒前
某只橘猫君完成签到,获得积分10
23秒前
暴躁的山灵完成签到,获得积分10
24秒前
夜枫完成签到 ,获得积分10
27秒前
28秒前
sxl完成签到,获得积分10
28秒前
芋泥完成签到 ,获得积分10
28秒前
轻松棉花糖完成签到 ,获得积分10
29秒前
轻松棉花糖完成签到 ,获得积分10
29秒前
雨旸时若完成签到,获得积分10
29秒前
林海完成签到 ,获得积分10
30秒前
31秒前
帅气的祥发布了新的文献求助10
33秒前
Serein完成签到,获得积分10
33秒前
勤奋的毛豆完成签到,获得积分10
34秒前
三木完成签到 ,获得积分10
34秒前
老迟到的妙芙完成签到,获得积分10
36秒前
PePsi完成签到 ,获得积分10
38秒前
缓慢怜菡应助陈功城采纳,获得10
38秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
PowerCascade: A Synthetic Dataset for Cascading Failure Analysis in Power Systems 2000
Metallurgy at high pressures and high temperatures 2000
An Introduction to Medicinal Chemistry 第六版习题答案 600
应急管理理论与实践 530
Cleopatra : A Reference Guide to Her Life and Works 500
Fundamentals of Strain Psychology 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6339929
求助须知:如何正确求助?哪些是违规求助? 8155055
关于积分的说明 17136002
捐赠科研通 5395691
什么是DOI,文献DOI怎么找? 2858829
邀请新用户注册赠送积分活动 1836580
关于科研通互助平台的介绍 1686875