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

Deqiang Huang

dblp:377/5832 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0005-7154-9978ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 1 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.

Artificial intelligence
2 papers
Planning, search and constraint satisfaction · 44% Question answering and dialogue systems · 22% Robot manipulation · 22%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 50% Graph data management · 50%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Question answering and dialogue systems
conversational agents
1.012026
Uncertainty-Aware Planning for Disambiguating User Intent in Interactive LLM Agents: Application to Baidu Maps · KDD (1) 2026
Robotics › Robot manipulation › human-robot interaction
intent disambiguation
1.012026
Uncertainty-Aware Planning for Disambiguating User Intent in Interactive LLM Agents: Application to Baidu Maps · KDD (1) 2026
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
planning under uncertainty
1.012026
Uncertainty-Aware Planning for Disambiguating User Intent in Interactive LLM Agents: Application to Baidu Maps · KDD (1) 2026
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
task planning
1.012026
Uncertainty-Aware Planning for Disambiguating User Intent in Interactive LLM Agents: Application to Baidu Maps · KDD (1) 2026
Graph data management › graph algorithms
graph pruning
1.012026
Knowledge Graph Pruning for Recommendation · ACM Trans. Inf. Syst. 2026
Recommender systems › knowledge-aware recommendation
knowledge graph-based recommendation
1.012026
Knowledge Graph Pruning for Recommendation · ACM Trans. Inf. Syst. 2026

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

importance evaluation · 2.0graph neural network · 2.0community consensus · 2.0uncertainty estimation · 1.0large language model · 1.0beam search · 1.0
YearPublicationVenuePosition
2026 Uncertainty-Aware Planning for Disambiguating User Intent in Interactive LLM Agents: Application to Baidu Maps
abstract
Large language models (LLMs) are revolutionizing user interactions in online map applications by enabling conversational interfaces with intelligent map agents. However, inherent ambiguities and nuances in human communication often lead to incomplete or unclear user instructions. While generating clarification questions can mitigate this issue, existing methods—which rely on prompt-based LLM assessments or supervised fine-tuning (SFT) of LLMs with limited annotated data—struggle to reliably determine when clarification is necessary, resulting in cold-start issues and reduced adaptability. To address this gap, we propose an uncertainty-aware dynamic planning framework for intent disambiguation in interactive agent systems, exemplified by Baidu Maps. Our framework leverages LLMs to dynamically generate agent action sequences while estimating query uncertainty. When uncertainty thresholds are exceeded, targeted clarification questions are triggered. Besides, to efficiently navigate the vast uncertainty space, we introduce a novel beam search-based pruning strategy. Crucially, the framework supports context-aware task planning without any additional model training. We evaluate our approach on Baidu Maps and a public robotic task, focusing on uncertainty management and adaptability. Experiments demonstrate that the framework achieves high precision across diverse LLMs without requiring an additional training phase, highlighting its versatility and robustness. Ablation studies confirm that the framework can significantly improve user intent recognition and task success rates.
Deqiang Huang, Xinjiang Lu, Jingbo Zhou 0003, Nijia Lu, Fuxin Li, Chuanming Zhang, Tong Xu 0001, Enhong Chen
KDD (1)1
2026 Knowledge Graph Pruning for Recommendation
abstract
Recent years have witnessed the prosperity of Knowledge Graph-Based Recommendation System (KGRS), which enriches the representation of users, items, and entities by structural knowledge with striking improvement. Nevertheless, its unaffordable computational cost still limits researchers from exploring more sophisticated models. We observe that the bottleneck for training efficiency arises from the knowledge graph, which is plagued by the well-known issue of knowledge explosion. Recently, some works have attempted to slim the inflated KG via summarization techniques, which summarize multiple real nodes into the single virtual one. However, these summarized virtual nodes may ignore collaborative signals and thus fail to figure out the redundant nodes related to recommendation task. To this end, in this article, we propose a novel approach called KGTrimmer for knowledge graph pruning tailored for recommendation, to remove the unessential nodes while minimizing performance degradation. Specifically, we design an importance evaluator from a dual-view perspective. For the collective view, we embrace the idea of collective intelligence by extracting community consensus based on abundant collaborative signals, i.e., nodes are considered important if they attract attention of numerous users. For the holistic view, we learn a global mask to identify the valueless nodes from their inherent properties or overall popularity. With the collective and holistic importance scores, we build an end-to-end importance-aware graph neural network, which injects filtered knowledge to enhance the distillation of valuable user-item collaborative signals. Ultimately, we generate a pruned knowledge graph with lightweight, stable, and robust properties to facilitate the following-up recommendation task. Extensive experiments are conducted on three publicly available datasets to prove the effectiveness and generalizability of KGTrimmer, where it can reduce the number of triplets in KG by up to 90% without compromising performance.
Fake Lin, Xi Zhu 0004, Ziwei Zhao 0002, Deqiang Huang, Yu Yu 0008, Xueying Li 0004, Zhi Zheng 0008, Tong Xu 0001, Enhong Chen
ACM Trans. Inf. Syst.4