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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
CodeCraft应助fighting采纳,获得10
刚刚
佘拜拜发布了新的文献求助10
1秒前
高源发布了新的文献求助10
2秒前
2秒前
录音机的基本原理完成签到,获得积分10
3秒前
Belle完成签到,获得积分10
4秒前
贇宝宝完成签到 ,获得积分10
4秒前
欢呼吐司完成签到,获得积分10
4秒前
我是老大应助刘欢采纳,获得10
5秒前
时光机完成签到,获得积分10
5秒前
思源应助LEON采纳,获得10
6秒前
joyland完成签到,获得积分10
9秒前
煖瞳完成签到,获得积分10
10秒前
研友_VZG7GZ应助aniver采纳,获得10
11秒前
11秒前
梵蒂冈完成签到 ,获得积分10
12秒前
12秒前
情怀应助lynn采纳,获得10
13秒前
14秒前
15秒前
欣宇发布了新的文献求助10
17秒前
17秒前
18秒前
Owen应助稳重的半梅采纳,获得10
18秒前
18秒前
19秒前
19秒前
替代发布了新的文献求助10
19秒前
HXie完成签到,获得积分10
19秒前
suprWZY发布了新的文献求助50
19秒前
cr发布了新的文献求助60
20秒前
HALEE发布了新的文献求助10
21秒前
冉纯菲完成签到,获得积分10
21秒前
无风完成签到 ,获得积分10
21秒前
星星的金子完成签到,获得积分10
23秒前
23秒前
aniver发布了新的文献求助10
24秒前
天天快乐应助grx采纳,获得10
24秒前
冉纯菲发布了新的文献求助10
25秒前
文强完成签到,获得积分10
26秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
PowerCascade: A Synthetic Dataset for Cascading Failure Analysis in Power Systems 2000
Picture this! Including first nations fiction picture books in school library collections 1500
Instituting Science: The Cultural Production of Scientific Disciplines 666
Signals, Systems, and Signal Processing 610
The Organization of knowledge in modern America, 1860-1920 / 600
Unlocking Chemical Thinking: Reimagining Chemistry Teaching and Learning 555
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 物理 内科学 复合材料 催化作用 物理化学 光电子学 电极 细胞生物学 基因 无机化学
热门帖子
关注 科研通微信公众号,转发送积分 6359876
求助须知:如何正确求助?哪些是违规求助? 8173953
关于积分的说明 17216209
捐赠科研通 5414777
什么是DOI,文献DOI怎么找? 2865659
邀请新用户注册赠送积分活动 1842966
关于科研通互助平台的介绍 1691182