Disentangled Denoising and Counterfactual Balance for Multimodal Recommendation
Recently, graph convolutional network-based dual-view multimodal recommendation methods have achieved great success. They extract multimodal and behavior features based on item-item and user-item graphs, respectively. However, they still have two- fold limitations. First, the relevance between multimodal semantics and user preferences is ignored, resulting in the propagation and coupling of preference-irrelevant noise. Second, the direct use of uneven factual user-item graphs is suboptimal, as both redundant noisy edges and missing positive interaction edges impair recommendations. To solve the above issues, we propose a <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><b>D</b></u>isent<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><b>A</b></u>ngled de<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><b>N</b></u>oising and <underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><b>C</b></u>ounterfactual balanc<underline xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><b>E</b></u> method for multimodal recommendation, dubbed as <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">DANCE</b>. Specifically, for multimodal features, we explicitly disentangle them into preference-relevant and preference-irrelevant representations, to absorb and discard irrelevant noise via the latter. An orthogonal regularization and a contrastive learning task on preference relevance score prediction are proposed as the dual safeguard to prevent preference-relevant representations from encoding irrelevant noise. For behavior feature extraction, we construct a balanced user-item graph by integrating factual and counterfactual graphs. In this process, we pre-train a behavior simulator to build the counterfactual graph with full interactions. Top-<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$K$</tex-math></inline-formula> sampling is adopted to omit noisy edges and add missing edges in the graph. The final recommendation is performed upon the fused representation of preference-relevant multimodal and behavior representations. Extensive experiments on three public datasets verify the power of our DANCE.
Authors
- Weizhi Nie (ORCID: https://orcid.org/0000-0002-0578-8138)
- Xin Wen (ORCID: https://orcid.org/0000-0001-8379-4149)
- Yuting Su (ORCID: https://orcid.org/0000-0001-5165-204X)
- An-An Liu (ORCID: https://orcid.org/0000-0001-5755-9145)
- Jing Liu (ORCID: https://orcid.org/0000-0003-4690-1886)
- Ning Zhang (ORCID: https://orcid.org/0000-0003-2350-5645)
Institutions
- Tianjin University (CN)
- Renmin University of China (CN)
Publication Details
- Journal
- IEEE Transactions on Multimedia
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1109/tmm.2025.3613112
- Citations
- 1
- Primary Topic
- Image Retrieval and Classification Techniques
- Type
- article
- Field-Weighted Citation Impact
- 1.28