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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
anabas关注了科研通微信公众号
1秒前
健忘鞋垫完成签到,获得积分10
1秒前
科研通AI6.4应助lisier采纳,获得10
1秒前
2秒前
minet完成签到,获得积分10
2秒前
3秒前
zzz发布了新的文献求助10
3秒前
风姿物语完成签到,获得积分10
4秒前
噜啦噜啦嘞完成签到,获得积分10
4秒前
陶醉八宝粥完成签到,获得积分10
4秒前
情怀应助Starch_Borderer采纳,获得10
5秒前
epitome完成签到 ,获得积分10
5秒前
张佳宁发布了新的文献求助30
6秒前
chy发布了新的文献求助10
6秒前
6秒前
7秒前
科研通AI6.4应助Ma采纳,获得10
9秒前
9秒前
南国有佳人完成签到,获得积分10
9秒前
9秒前
科研通AI6.2应助sishen采纳,获得10
10秒前
11秒前
FashionBoy应助chy采纳,获得10
11秒前
万能图书馆应助Aprilapple采纳,获得10
12秒前
12秒前
wanci应助怕黑三毒采纳,获得10
13秒前
yang完成签到,获得积分10
13秒前
刘龙应助科研通管家采纳,获得10
13秒前
斯文败类应助科研通管家采纳,获得10
13秒前
黄永祥发布了新的文献求助10
13秒前
13秒前
科目三应助科研通管家采纳,获得10
14秒前
隐形曼青应助科研通管家采纳,获得10
14秒前
熊孩子完成签到,获得积分20
14秒前
崔万齐完成签到,获得积分10
14秒前
小二郎应助科研通管家采纳,获得10
14秒前
v0id应助科研通管家采纳,获得10
14秒前
Shawn完成签到,获得积分10
14秒前
666发布了新的文献求助10
14秒前
刘龙应助科研通管家采纳,获得10
14秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Essentials of Carbohydrate Chemistry and Biochemistry, 4th Edition 800
Organizational Behavior 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
CLSI VET01S-2024 Performance Standards for Antimicrobial Disk and Dilution Susceptibility Tests for Bacteria Isolated From Animals (7th Ed) 500
A Case Study on Hotels as Noncongregate Emergency Living Accommodations for Returning Citizens 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 化学工程 工程类 有机化学 物理 复合材料 生物化学 内科学 细胞生物学 基因 遗传学 免疫学 冶金 光电子学 癌症研究
热门帖子
关注 科研通微信公众号,转发送积分 7764133
求助须知:如何正确求助?哪些是违规求助? 9308391
关于积分的说明 20305417
捐赠科研通 7348776
什么是DOI,文献DOI怎么找? 3314223
关于科研通互助平台的介绍 2463838
邀请新用户注册赠送积分活动 2328366