已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
lyw发布了新的文献求助10
刚刚
刚刚
王世缘发布了新的文献求助10
1秒前
2秒前
大仙完成签到 ,获得积分10
3秒前
丰富的甜瓜完成签到,获得积分10
4秒前
HJX完成签到 ,获得积分10
5秒前
6秒前
7秒前
7秒前
10秒前
Flos完成签到,获得积分10
10秒前
10秒前
fire完成签到 ,获得积分10
11秒前
默默板凳发布了新的文献求助10
12秒前
13秒前
英俊大树发布了新的文献求助10
13秒前
harry发布了新的文献求助200
15秒前
15秒前
Vaseegara完成签到 ,获得积分10
18秒前
溯洄源点发布了新的文献求助10
20秒前
蛙蛙完成签到,获得积分0
21秒前
seuu关注了科研通微信公众号
21秒前
X57完成签到 ,获得积分10
22秒前
22秒前
hhh完成签到 ,获得积分10
24秒前
Joif发布了新的文献求助10
24秒前
我是老大应助科研通管家采纳,获得10
25秒前
ding应助科研通管家采纳,获得10
25秒前
25秒前
852应助科研通管家采纳,获得10
25秒前
英姑应助科研通管家采纳,获得10
25秒前
上官若男应助科研通管家采纳,获得10
25秒前
无花果应助科研通管家采纳,获得10
25秒前
李健的小迷弟应助科研狗采纳,获得10
25秒前
充电宝应助科研通管家采纳,获得10
25秒前
天天快乐应助科研通管家采纳,获得10
25秒前
25秒前
26秒前
开心快乐水完成签到 ,获得积分10
26秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
48V Low-voltage Power Distribution Network (PDN) Architecture Industry Report, 2024 800
Fundamentals of Pharmaceutical and Biologics Regulations: A Global Perspective, Second Edition 700
Direct and Iterative Linear System Solvers 500
Plato's Parmenides. A Constructive Reading 500
Vander's Renal Physiology第10版 500
Poetics of Cognition 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7304298
求助须知:如何正确求助?哪些是违规求助? 8922404
关于积分的说明 18901399
捐赠科研通 6967819
什么是DOI,文献DOI怎么找? 3212094
关于科研通互助平台的介绍 2380918
邀请新用户注册赠送积分活动 2189356