已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
冰糖橙完成签到 ,获得积分10
1秒前
tinner完成签到,获得积分10
1秒前
4秒前
NexusExplorer应助Jerry采纳,获得10
5秒前
huangshizhi发布了新的文献求助10
6秒前
yu完成签到,获得积分10
7秒前
开朗的千雁完成签到 ,获得积分10
8秒前
9秒前
trophozoite完成签到 ,获得积分10
10秒前
yu发布了新的文献求助10
11秒前
勤耕苦读完成签到,获得积分10
12秒前
eeevaxxx完成签到 ,获得积分10
13秒前
愉快惮完成签到,获得积分10
14秒前
Ou完成签到,获得积分10
14秒前
疯大仙外向太清完成签到,获得积分10
14秒前
15秒前
鹿璟璟完成签到 ,获得积分10
15秒前
16秒前
17秒前
李爱国应助三十采纳,获得10
19秒前
Jerry发布了新的文献求助10
20秒前
饭饭完成签到 ,获得积分10
21秒前
Jiaaa完成签到 ,获得积分10
22秒前
白雅颂完成签到 ,获得积分10
22秒前
合适熊猫完成签到 ,获得积分10
23秒前
壮观的海豚完成签到 ,获得积分10
23秒前
llzuo发布了新的文献求助10
24秒前
25秒前
不开心完成签到 ,获得积分10
25秒前
26秒前
顺利白竹完成签到 ,获得积分10
26秒前
CC完成签到,获得积分10
26秒前
严明完成签到,获得积分0
27秒前
abb先生发布了新的文献求助10
28秒前
29秒前
xiaoganlan完成签到 ,获得积分10
30秒前
chenghhh发布了新的文献求助10
30秒前
Jerry完成签到,获得积分10
30秒前
bill完成签到,获得积分20
31秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Cronologia da história de Macau 5000
咳嗽・喀痰の診療ガイドライン第2版2025 800
Petrology and Plate Tectonics 800
Prompt Engineering for Clinicians: Harnessing AI in Everyday Medical Practice 600
《KNN基无铅压电陶瓷电学性能优化与物理机理研究》 500
The globalisation of real estate: the politics and practice of foreign real estate investment 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 光电子学 物理化学 电极 基因 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 7002097
求助须知:如何正确求助?哪些是违规求助? 8677262
关于积分的说明 18397051
捐赠科研通 6480511
什么是DOI,文献DOI怎么找? 3101292
关于科研通互助平台的介绍 2166640
邀请新用户注册赠送积分活动 2077570