Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mengru Chen

dblp:340/8601 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-2277-3755ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Recommender systems · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.912025
Collaborative Diffusion Models for Recommendation · SIGIR 2025
Recommender systems
multimodal recommendation
0.912025
Collaborative Diffusion Models for Recommendation · SIGIR 2025
Recommender systems
side information integration
0.912025
Collaborative Diffusion Models for Recommendation · SIGIR 2025
Recommender systems › representation learning for recommendation
contrastive learning for recommendation
0.712023
Heterogeneous Graph Contrastive Learning for Recommendation · WSDM 2023
Recommender systems › graph-based recommendation
graph neural network recommendation
0.712023
Heterogeneous Graph Contrastive Learning for Recommendation · WSDM 2023
Recommender systems › graph-based recommendation
heterogeneous information network recommendation
0.712023
Heterogeneous Graph Contrastive Learning for Recommendation · WSDM 2023

Methods — techniques the papers use, named apart from their topics

diffusion model · 0.9conditional generation · 0.9meta-network · 0.7graph neural network · 0.7contrastive learning · 0.7
YearPublicationVenuePosition
2025 Collaborative Diffusion Models for Recommendation
abstract
Recently, recommendation models based on collaborative filtering have increasingly leveraged not only primary user-item interactions but also auxiliary information such as implicit relational structures (e.g., user-user or item-item graphs) and multimodal content (e.g., images and textual descriptions) to enhance recommendation performance. A key challenge in this context lies in effectively integrating auxiliary features derived from semantic structures or modality representations into user-item modeling, in a way that enhance performance without incurring detrimental effects. Furthermore, since these features often originate from heterogeneous semantic or modal spaces, they may include redundant or task-irrelevant information that can hinder the learning process. To address these issues, we propose the Collaborative Diffusion Models for Recommendation (CoDMR). CoDMR employs diffusion models in latent feature spaces to filter out task-irrelevant noise embedded in auxiliary features. It introduces task-relevant collaborative signals as conditional guidance during the denoising process, facilitating the generation of auxiliary representations aligned with the recommendation task. These refined features are then incorporated into user-item interaction modeling, resulting in enhanced representations for both users and items. Extensive experiments on three public datasets consistently demonstrate that our CoDMR method outperforms various competitive baselines. The source code of the model implementation is available at the link https://github.com/cmr123456/CoDMR.
Mengru Chen, Lianghao Xia, Yong Xu 0007, Ronghua Luo
SIGIR1
2023 Heterogeneous Graph Contrastive Learning for Recommendation
abstract
Graph Neural Networks (GNNs) have become powerful tools in modeling graph-structured data in recommender systems. However, real-life recommendation scenarios usually involve heterogeneous relationships (e.g., social-aware user influence, knowledge-aware item dependency) which contains fruitful information to enhance the user preference learning. In this paper, we study the problem of heterogeneous graph-enhanced relational learning for recommendation. Recently, contrastive self-supervised learning has become successful in recommendation. In light of this, we propose a Heterogeneous Graph Contrastive Learning (HGCL), which is able to incorporate heterogeneous relational semantics into the user-item interaction modeling with contrastive learning-enhanced knowledge transfer across different views. However, the influence of heterogeneous side information on interactions may vary by users and items. To move this idea forward, we enhance our heterogeneous graph contrastive learning with meta networks to allow the personalized knowledge transformer with adaptive contrastive augmentation. The experimental results on three real-world datasets demonstrate the superiority of HGCL over state-of-the-art recommendation methods. Through ablation study, key components in HGCL method are validated to benefit the recommendation performance improvement. The source code of the model implementation is available at the link https://github.com/HKUDS/HGCL.
Mengru Chen, Chao Huang 0001, Lianghao Xia, Wei Wei 0027, Yong Xu 0007, Ronghua Luo
WSDM1