PEARL: A dual-layer graph learning for multimodal recommendation

Multimodal recommendation has increasingly become a mainstream information service technology, which transcends traditional user–item interaction-based recommender systems by integrating the multimodal features of items. Although existing works have made notable progress by focusing on user–item interaction graph structures and self-supervised learning to enhance multimodal representation learning , they still exhibit the following two limitations: (1) Performing graph convolution operations on a fixed interaction graph introduces misleading noisy signals caused by user’s imbalanced attention on various modalities. (2) Lacking exploration of inherent self-supervised signals in multimodal attributes fails to mitigate the distribution bias introduced during data augmentation . To address these issues, we propose a novel method named P urified-int E raction and A ffinity g R aph L earning ( PEARL ) for multimodal recommendation, which utilizes a dual-layer graph learning to model the user preference. Specifically, to eliminate misleading noisy signals, we designed a graph purification strategy that constructs purified modality-specific interaction graphs, thereby removing noisy edges from the raw interaction graph. Then, the user and item affinity graphs are constructed based on the user co-occurrences and the item multimodal features, respectively, which are then utilized for message passing to mine the implicit self-supervised signals between similar users or items. After that, we propose an augmentation-free contrastive learning task in the fusion module to improve the quality of ID embeddings and multimodal features, ultimately generating the final representations of users and items. Comprehensive experimental results on three publicly available datasets verify the superiority of PEARL against diverse state-of-the-art baselines, where the improvements are especially noticeable in large-scale datasets. Our experimental code and data utilized in this work can be accessed at https://github.com/Yuzhuo-Dang/PEARL . • Enhancing multimodal recommendation through a dual-layer graph learning framework. • Eliminating the noise caused by the user’s imbalanced attention for the first time. • Mining the intra-modal self-supervised signals through the affinity graph learning. • Introducing an augmentation-free contrastive learning task based on modal attributes. • Sufficient experimental results on three datasets verify the superiority of PEARL.

Authors

Institutions

Publication Details

Journal
Information Fusion
Published
2025-04-08
DOI
https://doi.org/10.1016/j.inffus.2025.103168
Citations
6
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
14.89
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PEARL: A dual-layer graph learning for multimodal recommendation

Yuzhuo Dang, Honghui Chen, Zhiqiang Pan, Yuxiao Duan et al.
6 citations
Information Fusion
Topic Modeling
14.89
article

PEARL: A dual-layer graph learning for multimodal recommendation

Yuzhuo Dang, Honghui Chen, Zhiqiang Pan, Yuxiao Duan, Fei Cai, Wanyu Chen
article en
6 citations

Abstract

Multimodal recommendation has increasingly become a mainstream information service technology, which transcends traditional user–item interaction-based recommender systems by integrating the multimodal features of items. Although existing works have made notable progress by focusing on user–item interaction graph structures and self-supervised learning to enhance multimodal representation learning , they still exhibit the following two limitations: (1) Performing graph convolution operations on a fixed interaction graph introduces misleading noisy signals caused by user’s imbalanced attention on various modalities. (2) Lacking exploration of inherent self-supervised signals in multimodal attributes fails to mitigate the distribution bias introduced during data augmentation . To address these issues, we propose a novel method named P urified-int E raction and A ffinity g R aph L earning ( PEARL ) for multimodal recommendation, which utilizes a dual-layer graph learning to model the user preference. Specifically, to eliminate misleading noisy signals, we designed a graph purification strategy that constructs purified modality-specific interaction graphs, thereby removing noisy edges from the raw interaction graph. Then, the user and item affinity graphs are constructed based on the user co-occurrences and the item multimodal features, respectively, which are then utilized for message passing to mine the implicit self-supervised signals between similar users or items. After that, we propose an augmentation-free contrastive learning task in the fusion module to improve the quality of ID embeddings and multimodal features, ultimately generating the final representations of users and items. Comprehensive experimental results on three publicly available datasets verify the superiority of PEARL against diverse state-of-the-art baselines, where the improvements are especially noticeable in large-scale datasets. Our experimental code and data utilized in this work can be accessed at https://github.com/Yuzhuo-Dang/PEARL . • Enhancing multimodal recommendation through a dual-layer graph learning framework. • Eliminating the noise caused by the user’s imbalanced attention for the first time. • Mining the intra-modal self-supervised signals through the affinity graph learning. • Introducing an augmentation-free contrastive learning task based on modal attributes. • Sufficient experimental results on three datasets verify the superiority of PEARL.

Information FusionVol. 122
National University of Defense Technology (CN)
Openalex Percentile: Top 1%
Topic Modeling
14.89
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.