Tiancheng Huang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tiancheng Huang has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Donglin Wang
Westlake University, Hangzhou, CHINA
2 shared publications - Feng Zhao
Westlake University, China
2 shared publications - Hao Li
State Key Laboratory of Fluid Power and Mechatronic System, School of Mechanical Engineering, Zhejiang University, Hangzhou, China
1 shared publication - Junda Ye
Beijing University of Posts and Telecommunications, Beijing, China
1 shared publication - Kai Wang
College of Computing and Data Science, Nanyang Technological University
1 shared publication - Min Zhang
East China Normal University, Shanghai, China, and MBZUAI, Abu Dhabi, United Arab Emirates
1 shared publication
Latest Publications
- Top Cited PapersOpen Access
- 3 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (10) , 1-38
Graph-Based Approaches and Functionalities in Retrieval-Augmented Generation: A Comprehensive Survey
Large language models (LLMs) struggle with the factual error during inference due to the lack of sufficient training data and the most updated knowledge, leading to the hallucination problem. Retrieval-Augmented Generation (RAG) has gained attention as a promising solution to address the limitation of LLMs, by retrieving relevant information from external source to generate more accurate answers to the questions. Given the pervasive presence of structured knowledge in the external source, considerable strides in RAG have been made to employ the techniques related to graphs and achieve more complex reasoning based on the topological information between knowledge entities. Although recent surveys summarize RAG pipelines, they largely restrict the role of graphs to knowledge-graph traversal, leaving the broader impacts of graph structure on retrieval, prompting, and pipeline control underexplored. This survey offers a novel perspective on the functionality of graphs within RAG and their impact on enhancing performance across a wide range of graph-structured data. It provides a detailed breakdown of the roles that graphs play in RAG, covering database construction, algorithms, pipelines, and tasks. Finally, it identifies current challenges and outline future research directions, aiming at inspiring further developments in this field. Our graph-centered analysis highlights the commonalities and differences in existing methods, setting the stage for future researchers in areas such as graph learning, database systems, and natural language processing.
- 3 April 2026
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (10) , 1-38
Top Cited PapersOpen AccessGraph-Based Approaches and Functionalities in Retrieval-Augmented Generation: A Comprehensive Survey
Large language models (LLMs) struggle with the factual error during inference due to the lack of sufficient training data and the most updated knowledge, leading to the hallucination problem. Retrieval-Augmented Generation (RAG) has gained attention as a promising solution to address the limitation of LLMs, by retrieving relevant information from external source to generate more accurate answers to the questions. Given the pervasive presence of structured knowledge in the external source, considerable strides in RAG have been made to employ the techniques related to graphs and achieve more complex reasoning based on the topological information between knowledge entities. Although recent surveys summarize RAG pipelines, they largely restrict the role of graphs to knowledge-graph traversal, leaving the broader impacts of graph structure on retrieval, prompting, and pipeline control underexplored. This survey offers a novel perspective on the functionality of graphs within RAG and their impact on enhancing performance across a wide range of graph-structured data. It provides a detailed breakdown of the roles that graphs play in RAG, covering database construction, algorithms, pipelines, and tasks. Finally, it identifies current challenges and outline future research directions, aiming at inspiring further developments in this field. Our graph-centered analysis highlights the commonalities and differences in existing methods, setting the stage for future researchers in areas such as graph learning, database systems, and natural language processing.
- Open Access
- 12 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 462-471
TAGM: Task-Aware Graph Model for Few-shot Node Classification
- 12 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 462-471
Open AccessTAGM: Task-Aware Graph Model for Few-shot Node Classification
- 8 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (1) , 1415-1422
Graph Few-Shot Learning via Restructuring Task Graph
Existing graph few-shot learning (FSL) methods usually train a model on many task graphs and transfer the learned model to a new task graph. However, the task graphs often contain a great number of isolated nodes, which results in the severe deficiency of learned node embeddings. Furthermore, in the training process, the neglect of task information also constrains the model’s expressive ability. In this brief, we propose a novel metric-based graph few-shot learning approach via restructuring task graph (GFL-RTG). To solve the problems above, we innovatively restructure the task graph by adding class nodes and a task node to the original individual task graph. We first add class nodes and determine the connectivity between class nodes and others via their similarity. Then, we utilize a graph pooling network to learn a task embedding, which is regarded as a task node. Finally, the new task graph is restructured by combining class nodes, task node, and original nodes, which is then used as input to the metric-based graph neural network (GNN) to conduct few-shot learning. Our extensive experiments on three graph-structured datasets demonstrate that our proposed method generally outperforms the state-of-the-art baselines in few-shot learning.
- 8 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 35 (1) , 1415-1422
Graph Few-Shot Learning via Restructuring Task Graph
Existing graph few-shot learning (FSL) methods usually train a model on many task graphs and transfer the learned model to a new task graph. However, the task graphs often contain a great number of isolated nodes, which results in the severe deficiency of learned node embeddings. Furthermore, in the training process, the neglect of task information also constrains the model’s expressive ability. In this brief, we propose a novel metric-based graph few-shot learning approach via restructuring task graph (GFL-RTG). To solve the problems above, we innovatively restructure the task graph by adding class nodes and a task node to the original individual task graph. We first add class nodes and determine the connectivity between class nodes and others via their similarity. Then, we utilize a graph pooling network to learn a task embedding, which is regarded as a task node. Finally, the new task graph is restructured by combining class nodes, task node, and original nodes, which is then used as input to the metric-based graph neural network (GNN) to conduct few-shot learning. Our extensive experiments on three graph-structured datasets demonstrate that our proposed method generally outperforms the state-of-the-art baselines in few-shot learning.
- 17 August 2019
- Published by Springer Nature
- p. 769-777
Digital Human Modeling for Performance Evaluation During Marine Vehicle Operation
- 17 August 2019
- Published by Springer Nature
- p. 769-777
Digital Human Modeling for Performance Evaluation During Marine Vehicle Operation