Yuanyuan Zhu
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
Research Subjects
Yuanyuan Zhu has a total of 97 co-authors. Here are the top co-authors by number of shared publications:
- Ming Zhong
Wuhan University
14 shared publications - Tieyun Qian
Wuhan University
12 shared publications - Jeffrey Xu Yu
The Chinese University of Hong Kong, Hong Kong, China
11 shared publications - Jiawei Jiang
School of Computer Science, Wuhan University, Wuhan, China
7 shared publications - Mengchi Liu
South China Normal University
6 shared publications - Bo Du
School of Computer Science, Wuhan University, Wuhan, China
5 shared publications
Latest Publications
- 26 September 2026
- Published by Springer Nature
- p. 266-281
HBCGNN: An Inductive GNN Framework for Predicting Historical Betweenness Centrality in Temporal Graphs
- 26 September 2026
- Published by Springer Nature
- p. 266-281
HBCGNN: An Inductive GNN Framework for Predicting Historical Betweenness Centrality in Temporal Graphs
- 26 September 2026
- Published by Springer Nature
- p. 511-526
Just a “Hop” to Efficient Query of Optimal Temporal Paths: A Novel Labeling Approach
- 26 September 2026
- Published by Springer Nature
- p. 511-526
Just a “Hop” to Efficient Query of Optimal Temporal Paths: A Novel Labeling Approach
- 8 September 2026
- Published by Springer Nature
- p. 134-151
Can a Small Model Learn to Look Before It Leaps? Dynamic Learning and Proactive Correction for Hallucination Detection
- 8 September 2026
- Published by Springer Nature
- p. 134-151
Can a Small Model Learn to Look Before It Leaps? Dynamic Learning and Proactive Correction for Hallucination Detection
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2118-2128
Recursive Short-to-Long Generalization for Multi-hop Reasoning
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 2118-2128
Open AccessRecursive Short-to-Long Generalization for Multi-hop Reasoning
- 12 May 2026
- Published by Springer Nature
- p. 374-389
Debiasing LLMs in Knowledge-Intensive Tasks via Information-Gain Guided Front-Door Adjustment
- 12 May 2026
- Published by Springer Nature
- p. 374-389
Debiasing LLMs in Knowledge-Intensive Tasks via Information-Gain Guided Front-Door Adjustment
- Open Access
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-26
Accelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware
k -truss is one of the most widely used community models where each edge is contained in at least k -2 triangles, and Triangle-connected k -Truss Community ( k -TTC) is a strengthened variant of k -truss that further requires edges to reach each other via a series of adjacent triangles. EquiTree is the state-of-the-art tree-structured index, which is space efficient and can support time-optimal k -TTC search for query vertices. However, for large graphs with billions of edges, the sequential algorithm still needs seconds to conduct k -TTC search and hours to construct the index due to the costly triangle connectivity examination. In this paper, we study how to accelerate k -TTC search by hardware accelerators. Specifically, we propose a tensor-based framework, including index construction, online search, and index maintenance, which can be efficiently deployed and run on heterogeneous hardware. To accelerate index construction, we first propose an iterative basic algorithm which creates and refines supernodes and superedges based on each k -class layer by layer. To further boost the parallelism, we propose a triangle-based supernode and superedge creation strategy, which categorizes triangles into three types ( internal, marginal, external ), and applies tailored operations for each type to enable batch processing instead of iterative steps. Meanwhile, we propose the batch-based merging strategy to refine the index into a tree structure. We also propose tensor-based algorithms for online k -TTC search and index maintenance. Extensive experiments show that our tensor-based algorithms achieve an average speedup of two orders of magnitude over state-of-the-art methods in both index construction and community search, while efficiently maintaining indices for dynamic graphs. Moreover, we validated that our tensor-based algorithms can be smoothly deployed and run on heterogeneous hardware accelerators (NVIDIA GPUs and AMD GPUs) for acceleration.
- 2 April 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (1) , 1-26
Open AccessAccelerating Triangle-Connected Truss Community Search Across Heterogeneous Hardware
k -truss is one of the most widely used community models where each edge is contained in at least k -2 triangles, and Triangle-connected k -Truss Community ( k -TTC) is a strengthened variant of k -truss that further requires edges to reach each other via a series of adjacent triangles. EquiTree is the state-of-the-art tree-structured index, which is space efficient and can support time-optimal k -TTC search for query vertices. However, for large graphs with billions of edges, the sequential algorithm still needs seconds to conduct k -TTC search and hours to construct the index due to the costly triangle connectivity examination. In this paper, we study how to accelerate k -TTC search by hardware accelerators. Specifically, we propose a tensor-based framework, including index construction, online search, and index maintenance, which can be efficiently deployed and run on heterogeneous hardware. To accelerate index construction, we first propose an iterative basic algorithm which creates and refines supernodes and superedges based on each k -class layer by layer. To further boost the parallelism, we propose a triangle-based supernode and superedge creation strategy, which categorizes triangles into three types ( internal, marginal, external ), and applies tailored operations for each type to enable batch processing instead of iterative steps. Meanwhile, we propose the batch-based merging strategy to refine the index into a tree structure. We also propose tensor-based algorithms for online k -TTC search and index maintenance. Extensive experiments show that our tensor-based algorithms achieve an average speedup of two orders of magnitude over state-of-the-art methods in both index construction and community search, while efficiently maintaining indices for dynamic graphs. Moreover, we validated that our tensor-based algorithms can be smoothly deployed and run on heterogeneous hardware accelerators (NVIDIA GPUs and AMD GPUs) for acceleration.
- 30 January 2026
- Published by Springer Nature
- p. 387-402
SynTSE: A Syntax-Aware Generative Method for Topic-Stance Extraction
- 30 January 2026
- Published by Springer Nature
- p. 387-402
SynTSE: A Syntax-Aware Generative Method for Topic-Stance Extraction
- 1 January 2026
- Published by Springer Nature in World Wide Web
- Vol. 29 (3) , 25
Historical betweenness centrality and its computation
- 1 January 2026
- Published by Springer Nature in World Wide Web
- Vol. 29 (3) , 25
Historical betweenness centrality and its computation
- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (6) , 1-27
TQEx: Tensor-based Query Engine Enhanced by Bridging the Gap
With the development of AI and the growing demand for computational power, hardware is becoming increasingly specialized and heterogeneous. The emergence of diverse specialized hardware architectures, each with distinct characteristics and programming abstractions, poses significant portability and sustainability challenges for existing data processing systems. Tensor Computation Runtimes (TCRs) abstract away the low-level hardware complexities by providing users with a hardware-independent tensor-based interface, enabling data scientists to effectively leverage the powerful capabilities of new hardware accelerators (collectively referred to as XPU). Built on TCRs, the existing relational query engine TQP demonstrates portability across a wide range of target hardware and sustainability along with the ongoing evolution of TCRs and hardware. However, it neglects the big gap between irregular SQL workloads and uniform tensor operations when mapping SQL operators to tensor programs, which causes significant storage and computation overhead. In this paper, for the first time, we analyze the underlying gap between SQL and tensors, and provide guidelines to bridge it. Following these guidelines, we build a new Tensor-based Query Engine Enhanced (TQEx) by bridging the gap from multiple aspects: develop efficient storage and computation strategies for variable-length data, and design efficient SQL operators such as join and aggregate based on tensors. We also extend TQEx to multi-XPUs for large-scale data processing. Extensive experimental studies show that our query engine, TQEx, achieves a 9.6× speedup (with a peak of 41.9×) over TQP on TPC-H, and it is also 27.9× faster than leading GPU databases such as HeavyDB. On TPC-H at scale factor 100, TQEx outperforms DuckDB by 12.2× and HeavyDB by 22.7× on supported queries.
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 3 (6) , 1-27
Open AccessTQEx: Tensor-based Query Engine Enhanced by Bridging the Gap
With the development of AI and the growing demand for computational power, hardware is becoming increasingly specialized and heterogeneous. The emergence of diverse specialized hardware architectures, each with distinct characteristics and programming abstractions, poses significant portability and sustainability challenges for existing data processing systems. Tensor Computation Runtimes (TCRs) abstract away the low-level hardware complexities by providing users with a hardware-independent tensor-based interface, enabling data scientists to effectively leverage the powerful capabilities of new hardware accelerators (collectively referred to as XPU). Built on TCRs, the existing relational query engine TQP demonstrates portability across a wide range of target hardware and sustainability along with the ongoing evolution of TCRs and hardware. However, it neglects the big gap between irregular SQL workloads and uniform tensor operations when mapping SQL operators to tensor programs, which causes significant storage and computation overhead. In this paper, for the first time, we analyze the underlying gap between SQL and tensors, and provide guidelines to bridge it. Following these guidelines, we build a new Tensor-based Query Engine Enhanced (TQEx) by bridging the gap from multiple aspects: develop efficient storage and computation strategies for variable-length data, and design efficient SQL operators such as join and aggregate based on tensors. We also extend TQEx to multi-XPUs for large-scale data processing. Extensive experimental studies show that our query engine, TQEx, achieves a 9.6× speedup (with a peak of 41.9×) over TQP on TPC-H, and it is also 27.9× faster than leading GPU databases such as HeavyDB. On TPC-H at scale factor 100, TQEx outperforms DuckDB by 12.2× and HeavyDB by 22.7× on supported queries.
- Open Access
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 4, 3462-3470
Exploiting Text Semantics for Few and Zero Shot Node Classification on Text-attributed Graph
Text-attributed graph (TAG) provides a text description for each graph node, and few- and zero-shot node classification on TAGs have many applications in fields such as academia and social networks. Existing work utilizes various graph-based augmentation techniques to train the node and text embeddings, while text-based augmentations are largely unexplored. In this paper, we propose Text Semantics Augmentation (TSA) to improve accuracy by introducing more text semantic supervision signals. Specifically, we design two augmentation techniques, i.e., positive semantics matching and negative semantics contrast, to provide more reference texts for each graph node or text description. Positive semantic matching retrieves texts with similar embeddings to match with a graph node. Negative semantic contrast adds a negative prompt to construct a text description with the opposite semantics, which is contrasted with the original node and text. We evaluate TSA on 5 datasets and compare with 13 state-of-the-art baselines. The results show that TSA consistently outperforms all baselines, and its accuracy improvements over the best-performing baseline are usually over 5%. The code is at https://github.com/wyx11112/TSA.
- 1 September 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 4, 3462-3470
Open AccessExploiting Text Semantics for Few and Zero Shot Node Classification on Text-attributed Graph
Text-attributed graph (TAG) provides a text description for each graph node, and few- and zero-shot node classification on TAGs have many applications in fields such as academia and social networks. Existing work utilizes various graph-based augmentation techniques to train the node and text embeddings, while text-based augmentations are largely unexplored. In this paper, we propose Text Semantics Augmentation (TSA) to improve accuracy by introducing more text semantic supervision signals. Specifically, we design two augmentation techniques, i.e., positive semantics matching and negative semantics contrast, to provide more reference texts for each graph node or text description. Positive semantic matching retrieves texts with similar embeddings to match with a graph node. Negative semantic contrast adds a negative prompt to construct a text description with the opposite semantics, which is contrasted with the original node and text. We evaluate TSA on 5 datasets and compare with 13 state-of-the-art baselines. The results show that TSA consistently outperforms all baselines, and its accuracy improvements over the best-performing baseline are usually over 5%. The code is at https://github.com/wyx11112/TSA.