Let's Chat to Find the APIs: Connecting Human, LLM and Knowledge Graph through AI Chain
Qing Huang, Zhenyu Wan, Zhenchang Xing, Changjing Wang, Jieshan Chen, Xiwei Xu, Qinghua Lu
摘要
API recommendation methods have evolved from literal and semantic keyword matching to query expansion and query clarification. The latest query clarification method is knowledge graph (KG)-based, but limitations include out-of-vocabulary (OOV) failures and rigid question templates. To address these limitations, we propose a novel knowledge-guided query clarification approach for API recommendation that leverages a large language model (LLM) guided by KG. We utilize the LLM as a neural knowledge base to overcome OOV failures, generating fluent and appropriate clarification questions and options. We also leverage the structured API knowledge and entity relationships stored in the KG to filter out noise, and transfer the optimal clarification path from KG to the LLM, increasing the efficiency of the clarification process. Our approach is designed as an AI chain that consists of five steps, each handled by a separate LLM call, to improve accuracy, efficiency, and fluency for query clarification in API recommendation. We verify the usefulness of each unit in our AI chain, which all received high scores close to a perfect 5. When compared to the baselines, our approach shows a significant improvement in MRR, with a maximum increase of 63.9% higher when the query statement is covered in KG and 37.2% when it is not. Ablation experiments reveal that the guidance of knowledge in the KG and the knowledge-guided pathfinding strategy are crucial for our approach's performance, resulting in a 19.0% and 22.2% increase in MAP, respectively. Our approach demonstrates a way to bridge the gap between KG and LLM, effectively compensating for the strengths and weaknesses of both.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper4
- Self-supervised Quantized Representation for Seamlessly Integrating Knowledge Graphs with Large Language ModelsQika Lin, Tianzhe Zhao, Kai He, Zhen Peng 等ACL 2025 · 被引用 15 次
- LiSSA: Toward Generic Traceability Link Recovery Through Retrieval- Augmented GenerationDominik Fuchß, Tobias Hey, Jan Keim, Haoyu Liu 等ICSE 2025 · 被引用 8 次
- A Systematic Evaluation of Large Code Models in API Suggestion: When, Which, and HowChaozheng Wang, Shuzheng Gao, Cuiyun Gao, Wenxuan Wang 等ASE 2024 · 被引用 4 次
- API Pack: A Massive Multi-Programming Language Dataset for API Call GenerationZhen Guo, Adriana Meza Soria, Wei Sun, Yikang Shen 等ICLR 2025
它引用的顶会 Paper8
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah 等NeurIPS 2020 · 被引用 64,255 次
- CoAuthor: Designing a Human-AI Collaborative Writing Dataset for Exploring Language Model CapabilitiesMina Lee, Percy Liang, Qian YangCHI 2022 · 被引用 340 次
- What Do They Capture? - A Structural Analysis of Pre-Trained Language Models for Source CodeYao Wan, Wei Zhao, Hongyu Zhang, Yulei Sui 等ICSE 2022 · 被引用 66 次
- Automated Query Reformulation for Efficient Search based on Query Logs From Stack OverflowKaibo Cao, Chunyang Chen, Sebastian Baltes, Christoph Treude 等ICSE 2021 · 被引用 63 次
- Learning to Ask Appropriate Questions in Conversational RecommendationXuhui Ren, Hongzhi Yin, Tong Chen, Hao Wang 等SIGIR 2021 · 被引用 45 次
相关 Paper
- iQUEST: An Iterative Question-Guided Framework for Knowledge Base Question AnsweringShuai Wang, Yinan YuACL 2025 · 被引用 12 次
- Search-on-Graph: Iterative Informed Navigation for Large Language Model Reasoning on Knowledge GraphsJia Ao Sun, Hao Yu, Fabrizio Gotti, Fengran Mo 等KDD 2026 · 被引用 8 次
- Knowledge Graph Retrieval-Augmented Generation for LLM-based RecommendationShijie Wang, Wenqi Fan, Yue Feng, Shanru Lin 等ACL 2025
- Paths-over-Graph: Knowledge Graph Empowered Large Language Model ReasoningXingyu Tan, Xiaoyang Wang, Qing Liu, Xiwei Xu 等WWW 2025 · 被引用 86 次
- ProgRAG: Hallucination-Resistant Progressive Retrieval and Reasoning over Knowledge GraphsMinbae Park, Hyemin Yang, Jeonghyun Kim, Kunsoo Park 等AAAI 2026
