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

Jian Wang 0150

dblp:39/449-150 · DBLP profile ↗
shortlisted ← Back
4ranked-venue papers
3as first author
4since 2021 · last 2026
0000-0002-8940-9560ORCID · conflict

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

Databases, data management, data science and information retrieval · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 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
1 paper
Recommender systems · 100%

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

TopicWeightPapersLastEvidence papers
Recommender systems
collaborative filtering
0.912025
Hypergraph Collaborative Filtering With Adaptive Augmentation of Graph Data for Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Recommender systems › representation learning for recommendation
contrastive learning for recommendation
0.912025
Hypergraph Collaborative Filtering With Adaptive Augmentation of Graph Data for Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Recommender systems › collaborative filtering
graph collaborative filtering
0.912025
Hypergraph Collaborative Filtering With Adaptive Augmentation of Graph Data for Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Recommender systems › collaborative filtering › graph collaborative filtering
hypergraph collaborative filtering
0.912025
Hypergraph Collaborative Filtering With Adaptive Augmentation of Graph Data for Recommendation · IEEE Trans. Knowl. Data Eng. 2025

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

hypergraph neural network · 0.9data augmentation · 0.9contrastive learning · 0.9
YearPublicationVenuePosition
2026 Disentangled graph recommendation via dynamic long and short-term intent modeling
Jian Wang 0150, Jianrong Wang, Di Jin 0001
Inf. Process. Manag.1
2026 EMM: Plug-and-play memory-bank sampling for contrastive recommendation
Zhisheng Meng, Jian Wang 0150, Wenxia Chen, Ziang He
Neural Networks2
2026 Learning Disentangled Multimodal Intent Representations for Interpretable Recommendation
abstract
User decision-making behavior in recommender systems is jointly driven by a large number of underlying factors. Learning and revealing the representations of these latent factors can provide more robustness and interpretability. However, mining the latent intentions of user decision-making behaviors in existing multimodal recommendation studies faces the following two key challenges: (i) Modal Noise Pollution : In multimodal user intent modeling, inputs from individual modalities are inevitably corrupted by noise of varying severity. During message passing, a large proportion of irrelevant or even contradictory signals are propagated and injected into item representations, which impedes the model’s ability to achieve pure semantic alignment at the content level. (ii) User Intent Confounding : Real-world items naturally possess multiple attributes, with different attributes of the same item influencing distinct potential user intentions. However, in existing modeling designs for user intent, such intents are mapped onto user–item interaction labels of the same coarse granularity. This many-to-one mapping relationship between intentions and items leads to significant confounding and dilution of users’ fine-grained intentions. To address the above challenges, this work pays special attention to the implied user intent behind pure multimodal features. Specifically, we construct a dynamic, adaptive, multimodal intent disentanglement model. This model adopts a non-ID paradigm and mines the distribution of user intents in multimodal scenarios directly from users’ decision-making behaviors. A comprehensive experimental study on the Amazon dataset shows that the method is effective and provides a novel learning scheme for mining user intent in multimodal scenarios.
Jian Wang 0150, Jianrong Wang, Di Jin 0001
ACM Trans. Inf. Syst.1
2025 Hypergraph Collaborative Filtering With Adaptive Augmentation of Graph Data for Recommendation
abstract
Self-supervised tasks show significant advantages for node representation learning in recommender systems. This core idea of self-supervised task-based recommender systems depends on data augmentation to generate multi-view representations. However, there are two key challenges that are not well explored in existing self-supervised tasks: i) Restricted by the structure of the graph-based CF paradigm itself, the classical graph comparison learning architecture ignores the global structural information on the user-item interaction graph. ii) In a key part of existing contrast learning-random graph data enhancement schemes can significantly deteriorate model performance. To address these challenges, we propose a new hypergraph collaborative filtering with adaptive augmentation framework(HCFAA). It captures both local and global collaborative relationships on the user-item graph through a hypergraph-enhanced joint learning architecture. In particular, the designed adaptive structure-guided model ignores the noise introduced on unimportant edges, and thus learns the critical node information on the user-item graph. Comprehensive experimental studies on the Amazon dataset show that the method is effective, which provides an optimization scheme with a new perspective for the problems of key node loss in graph data enhancement and loss of higher-order structural information in GNN. The source code of our model can be available onhttps://github.com/RSnewbie/RS/tree/master/HCFAA.
Jian Wang 0150, Jianrong Wang, Di Jin 0001, Xinglong Chang
IEEE Trans. Knowl. Data Eng.1