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

Tuo Wang 0001

dblp:22/1899-1 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
8since 2021 · last 2026
0009-0004-3417-9974ORCID · conflict

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

Artificial intelligence and machine learning · 4 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-author · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author · 2 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
4 papers
Recommender systems · 97% Web and social media mining · 3%
Artificial intelligence
2 papers
Language models and text generation · 87% Graph learning · 13%

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

TopicWeightPapersLastEvidence papers
Recommender systems
graph-based recommendation
1.722025
Geometric-Augmented Self-Distillation for Graph-Based Recommendation · ACM Trans. Inf. Syst. 2025
Hierarchical Intent-Based Interest Disentanglement for Personalized Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Recommender systems
collaborative filtering
1.122025
Hierarchical Intent-Based Interest Disentanglement for Personalized Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Geometric-Augmented Self-Distillation for Graph-Based Recommendation · ACM Trans. Inf. Syst. 2025
Natural language and speech › Language models and text generation
large language model reasoning
1.012026
MSR-Rec: Multi-Step Reasoning-Enhanced LLM for Sequential Recommendation · AAAI 2026
Natural language and speech › Language models and text generation › large language model reasoning
multi-step reasoning
1.012026
MSR-Rec: Multi-Step Reasoning-Enhanced LLM for Sequential Recommendation · AAAI 2026
Recommender systems › user interest modeling
hierarchical interest learning
1.012026
Hierarchy-Aware Multimodal Distillation for Recommendation · IEEE Trans. Multim. 2026
Recommender systems
multimodal recommendation
1.012026
Hierarchy-Aware Multimodal Distillation for Recommendation · IEEE Trans. Multim. 2026
Recommender systems
sequential recommendation
1.012026
MSR-Rec: Multi-Step Reasoning-Enhanced LLM for Sequential Recommendation · AAAI 2026
Recommender systems
user interest modeling
1.012026
Hierarchy-Aware Multimodal Distillation for Recommendation · IEEE Trans. Multim. 2026
Recommender systems › user interest modeling
interest disentanglement
0.912025
Hierarchical Intent-Based Interest Disentanglement for Personalized Recommendation · IEEE Trans. Knowl. Data Eng. 2025
Machine learning › Graph learning
graph propagation
0.312026
Hierarchy-Aware Multimodal Distillation for Recommendation · IEEE Trans. Multim. 2026
Web and social media mining › social network analysis
interaction graph
0.312025
Geometric-Augmented Self-Distillation for Graph-Based Recommendation · ACM Trans. Inf. Syst. 2025

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

self-distillation · 2.9multimodal interaction graph · 2.0hyperbolic embedding · 2.0fine-tuning · 2.0chain-of-thought reasoning · 2.0intent queries · 0.9hyperbolic geometry · 0.9graph neural network · 0.9euclidean geometry · 0.9contrastive learning · 0.9
YearPublicationVenuePosition
2026 MSR-Rec: Multi-Step Reasoning-Enhanced LLM for Sequential Recommendation
abstract
Sequential recommendation has become indispensable in modern digital services. Prevalent recommendation techniques formulate the recommendation task with a language instruction fed into large language models (LLMs) to generate recommendations. However, the implicit interaction scenario of recommendation task cannot provide explicit reasoning supervision to activate LLM's multi-step reasoning capability. Besides, the manner of reasoning for enhancing recommendation is still underexplored. Therefore, we investigate activating multi-step reasoning with users' interactions and propose a multi-step reasoning-enhanced LLM (MSR-Rec), which tightly integrates reasoning with recommendation from designing reasoning chain to reasoning-based recommendation. A task-decomposed reasoning chain is elaborately designed to imitate users' thinking process, seamlessly involving reasoning into recommendation. Following the reasoning chain, MSR-Rec synthesizes reasoning supervision and fine-tunes LLM to adapt for task-specific reasoning. In inference, bidirectional reasoning is implemented from user and item sides, performing a closed-loop reasoning for recommendation. Comprehensive experiments demonstrate that MSR-Rec achieves the state-of-the-art performance in both recommendation quality and reasoning interpretability, advancing the integration of reasoning and recommendation in LLM-based systems.
Tuo Wang 0001, Meng Jian, Ge Shi 0002, Lifang Wu, Yashen Wang
AAAI1
2026 Hierarchy-Aware Multimodal Distillation for Recommendation
abstract
Beyond behavioral interaction records, multimedia recommendation scenarios possess abundant semantic signals, which provide excellent data support for user interest mining. Recently, the multimodal enhanced interaction graph has been actively explored and has achieved great progress. However, these methods overlook the capability disparity of various modalities in learning users' interests and lack the ability to explore the hierarchical relationships of interests in modality, resulting in suboptimal recommendation performance. Therefore, this work investigates intra-modality hierarchical learning and inter-modality guidance, proposing a hyperbolic self-distillation (HSD) model for multimedia recommendation. In each modality space, HSD introduces a hyperbolic propagation to filter users' hierarchical interests from the interaction graph effectively. Inter-modality interests are aligned further by a two-level self-distillation strategy to designate multimodal interactions to teach single-modal learning, aiming at teaching and learning to promote each other. Extensive experiments on four public datasets demonstrate that the proposed HSD outperforms leading baselines for multimedia recommendation, verifying the effectiveness of hierarchical propagation and two-level self-distillation in mining users' hierarchical interests.
Meng Jian, Tuo Wang 0001, Meijuan Yang, Lifang Wu
IEEE Trans. Multim.2
2025 Hierarchical Intent-Based Interest Disentanglement for Personalized Recommendation
abstract
To address the data sparsity issue, conventional graph-based models leverage structural signals from the interaction graph to embed users' interests. However, these models learn a uniform representation for interest modeling, which blends users' diverse intents and inevitably biases interest learning, hindering recommendations. Although the fine-grained paradigm can learn the intents of interactions separately to alleviate learning bias, the relationships among intents and the disentangled manner require elaborate design. Existing fine-grained models emphasize intent diversity and employ additional data splitting for disentanglement, which ignores the hierarchical relationship, exacerbates data sparsity, and increases the computational burden. To address these issues, we explore hierarchical intents and adaptive intent learning, proposing a hierarchical intent-based interest disentanglement (HIID) model for personalized recommendation. HIID introduces learnable intent queries to guide interest disentanglement from global interactions in a split-free manner. It raises a hierarchical intent hypothesis to involve hierarchical CF signals for interest modeling, where intents within the same level appear relatively diverse, and the in-depth intents are abstracted from the superficial ones. Both adaptive intent learning and hierarchical hypothesis help extract significant CF signals to promote personalized recommendation. Extensive experiments on public datasets show that the proposed HIID outperforms the state-of-the-art CF models for recommendation. Furthermore, HIID implements adaptive interest disentanglement in a split-free manner, improving the training efficiency of the recommender model compared to the existing fine-grained interest models.
Tuo Wang 0001, Meng Jian, Lifang Wu
IEEE Trans. Knowl. Data Eng.1
2025 Geometric-Augmented Self-Distillation for Graph-Based Recommendation
abstract
The prevalent recommendation techniques explore the graph structure of interactions to alleviate the interaction sparsity issue for inferring users’ interests. These graph models focus on extracting local structural signals to model users’ interests, introducing grid-like distortion and ignoring the hierarchical tree-like structure when learning from the interaction graph. The learned interests lack significant hierarchical signals, resulting in suboptimal recommendation performance. In this article, we investigate geometric-augmented graph learning with hyperbolic and Euclidean geometries to delve into local structural and hierarchical knowledge from the interaction graph. A self-teaching network called geometric-augmented self-distillation (GASD) is proposed to transfer hierarchical knowledge from hyperbolic to Euclidean space. The transfer learning enables shrinking of the network into a primary student to implement effective and efficient inference in Euclidean space, preventing computational burden in hyperbolic space. Experiments on publicly available datasets demonstrate that the proposed GASD outperforms the state-of-the-art models, verifying the effectiveness and efficiency of knowledge transfer by self-distillation to aggregate knowledge adaptively for personalized recommendation.
Meng Jian, Tuo Wang 0001, Zhuoyang Xia, Ge Shi 0002, Richang Hong, Lifang Wu
ACM Trans. Inf. Syst.2
2024 Light dual hypergraph convolution for collaborative filtering
Meng Jian, Langchen Lang, Zun Li 0001, Tuo Wang 0001, Lifang Wu
Pattern Recognit.5
2023 Compatible intent-based interest modeling for personalized recommendation
Meng Jian, Tuo Wang 0001, Shenghua Zhou, Langchen Lang, Lifang Wu
Appl. Intell.2
2023 Non-pairwise Collaborative Filtering
Meng Jian, Chenlin Zhang, Tuo Wang 0001, Lifang Wu
Neural Process. Lett.3
2022 Multi-intent Compatible Transformer Network for Recommendation
Tuo Wang 0001, Meng Jian, Ge Shi 0002, Lifang Wu
PRCV (1)1