Deqiang Huang

Deqiang Huang

Auto-generated profile, based on publicly available information

Deqiang Huang

University of Science and Technology of China, Hefei, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 November 2025 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
FLFake Lin
Fake Lin
XZXi Zhu
Xi Zhu
ZZZiwei Zhao
Ziwei Zhao
DHDeqiang Huang
Deqiang Huang
YYYu Yu
Yu Yu
ECEnhong Chen
Enhong Chen
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.