Tingting Wang
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
Tingting Wang has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Lei Duan
Sichuan University
3 shared publications - Zhifeng Bao
The University of Queensland, Brisbane, Australia
3 shared publications - Huiru Zheng
School of Computing, Ulster University, Belfast, United Kingdom
2 shared publications - Jesse Li-Ling
Center of Medical Genetics, West China Second University Hospital, Sichuan University, Chengdu, Sichuan 610041, China
2 shared publications - Ruiqi Qin
SAP (China) Co., Ltd., Chengdu, China
2 shared publications - Yidan Zhang
Sichuan University
2 shared publications
Latest Publications
- Open Access
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-28
AgenticScholar: Agentic Data Management with Pipeline Orchestration for Scholarly Corpora
Managing the rapidly growing scholarly corpus poses significant challenges in representation, reasoning, and efficient analysis. An ideal system should unify structured knowledge management, agentic planning, and interpretable execution to support diverse scholarly queries – from retrieval to knowledge discovery and generation – at scale. Unfortunately, existing RAG and document analytics systems fail to achieve all query types simultaneously. To this end, we propose AgenticScholar, an agentic scholarly data management system that integrates a structure-aware knowledge representation layer, an LLM-centric hybrid query planning layer, and a unified execution layer with composable operators. AgenticScholar autonomously translates natural language queries into executable DAG plans, enabling end-to-end reasoning over multi-modal scholarly data. Extensive experiments demonstrate that AgenticScholar significantly outperforms existing systems in effectiveness, efficiency, and interpretability, offering a practical foundation for future research on agentic scholarly data management.
- 18 May 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Management of Data
- Vol. 4 (3) , 1-28
Open AccessAgenticScholar: Agentic Data Management with Pipeline Orchestration for Scholarly Corpora
Managing the rapidly growing scholarly corpus poses significant challenges in representation, reasoning, and efficient analysis. An ideal system should unify structured knowledge management, agentic planning, and interpretable execution to support diverse scholarly queries – from retrieval to knowledge discovery and generation – at scale. Unfortunately, existing RAG and document analytics systems fail to achieve all query types simultaneously. To this end, we propose AgenticScholar, an agentic scholarly data management system that integrates a structure-aware knowledge representation layer, an LLM-centric hybrid query planning layer, and a unified execution layer with composable operators. AgenticScholar autonomously translates natural language queries into executable DAG plans, enabling end-to-end reasoning over multi-modal scholarly data. Extensive experiments demonstrate that AgenticScholar significantly outperforms existing systems in effectiveness, efficiency, and interpretability, offering a practical foundation for future research on agentic scholarly data management.
- Open Access
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 3219-3232
Distinctiveness Maximization in Datasets Assemblage
- 22 April 2025
- Published by Association for Computing Machinery (ACM)
- p. 3219-3232
Open AccessDistinctiveness Maximization in Datasets Assemblage
- 7 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (4) , 3712-3726
Dynamic Ridesharing With Minimal Regret: Towards an Enhanced Engagement Among Three Stakeholders
In dynamic ridesharing, the platform serves as the mediator by tailoring the assignment result between workers and riders with a focus on a certain objective. In this paper, we for the rst time study how to incorporate the willingness of all stakeholders (i.e., the platform, workers and riders). Given a set of workers and a set of rider requests, we aim to return the matchable worker-rider pairs in order to minimize the regret. Specically, two types of regret are dened: (i) the served rate regret, which refers to the rate of unserved requests, catering for the reputation and prot of the platform and workers; (ii) the revenue regret, which considers the portion of revenue loss from unserved riders, catering for the focus of workers and riders in the trip schedule. We prove the NP-hardness of this problem. To tackle this problem, we rst propose a dynamic programming insertion algorithm to improve the efciency of inserting a rider request into a trip schedule of a worker. Furthermore, two heuristic algorithms are devised to match rider requests with workers effectively. Comprehensive experiments on two real-world datasets verify the effectiveness, efciency and scalability of our solutions in dealing with different supply-demand relationships.
- 7 January 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (4) , 3712-3726
Dynamic Ridesharing With Minimal Regret: Towards an Enhanced Engagement Among Three Stakeholders
In dynamic ridesharing, the platform serves as the mediator by tailoring the assignment result between workers and riders with a focus on a certain objective. In this paper, we for the rst time study how to incorporate the willingness of all stakeholders (i.e., the platform, workers and riders). Given a set of workers and a set of rider requests, we aim to return the matchable worker-rider pairs in order to minimize the regret. Specically, two types of regret are dened: (i) the served rate regret, which refers to the rate of unserved requests, catering for the reputation and prot of the platform and workers; (ii) the revenue regret, which considers the portion of revenue loss from unserved riders, catering for the focus of workers and riders in the trip schedule. We prove the NP-hardness of this problem. To tackle this problem, we rst propose a dynamic programming insertion algorithm to improve the efciency of inserting a rider request into a trip schedule of a worker. Furthermore, two heuristic algorithms are devised to match rider requests with workers effectively. Comprehensive experiments on two real-world datasets verify the effectiveness, efciency and scalability of our solutions in dealing with different supply-demand relationships.
- 3 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 20 (5) , 2724-2735
An Integrative Disease Information Network Approach to Similar Disease Detection
Disease similarity analysis impacts significantly in pathogenesis revealing, treatment recommending, and disease-causing genes predicting. Previous works study the disease similarity based on the semantics obtaining from biomedical ontologies (e.g., disease ontology) or the function of disease-causing molecules. However, such methods almost focus on a single perspective for obtaining disease features, which may lead to biased results for similar disease detection. To address this issue, we propose a disease information network-based integrate approach named MISSION for detecting similar diseases. By leveraging the associations between diseases and other biomedical entities, the disease information network is established firstly. And then, the disease similarity features extracted from the aspects of disease taxonomy, attributes, literature, and annotations are integrated into the disease information network. Finally, the top-k similar disease query is performed based on the integrative disease information. The experiments conducted on real-world datasets demonstrate that MISSION is effective and useful in similar disease detection.
- 3 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 20 (5) , 2724-2735
An Integrative Disease Information Network Approach to Similar Disease Detection
Disease similarity analysis impacts significantly in pathogenesis revealing, treatment recommending, and disease-causing genes predicting. Previous works study the disease similarity based on the semantics obtaining from biomedical ontologies (e.g., disease ontology) or the function of disease-causing molecules. However, such methods almost focus on a single perspective for obtaining disease features, which may lead to biased results for similar disease detection. To address this issue, we propose a disease information network-based integrate approach named MISSION for detecting similar diseases. By leveraging the associations between diseases and other biomedical entities, the disease information network is established firstly. And then, the disease similarity features extracted from the aspects of disease taxonomy, attributes, literature, and annotations are integrated into the disease information network. Finally, the top-k similar disease query is performed based on the integrative disease information. The experiments conducted on real-world datasets demonstrate that MISSION is effective and useful in similar disease detection.
- 11 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Method for detection the non-soluble deposit density of insulators based on hyperspectral technology
The rapid development of agriculture and industry in China leads to a fast increase in the non-soluble deposit density (NSDD) of insulators. At present, the detection of NSDD is concentrated in the use of optical principles, which is difficult to achieve quantitative detection. Hyperspectral technique is a new comprehensive image data technique based on imaging spectroscopy, which has the advantages of multi-band, high resolution. Therefore, a non-contact detection method for detecting NSDD based on hyperspectral technique is proposed. The hyperspectral images of the insulator were obtained and preprocessed with black-and-white correction, which were used to establish the model based on the extreme learning machine with the kernel (KELM). Finally, the detection of NSDD was realized. Consequently, this study can guide the prevention of flash and configuration of external insulation in transmission lines.
- 11 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
Method for detection the non-soluble deposit density of insulators based on hyperspectral technology
The rapid development of agriculture and industry in China leads to a fast increase in the non-soluble deposit density (NSDD) of insulators. At present, the detection of NSDD is concentrated in the use of optical principles, which is difficult to achieve quantitative detection. Hyperspectral technique is a new comprehensive image data technique based on imaging spectroscopy, which has the advantages of multi-band, high resolution. Therefore, a non-contact detection method for detecting NSDD based on hyperspectral technique is proposed. The hyperspectral images of the insulator were obtained and preprocessed with black-and-white correction, which were used to establish the model based on the extreme learning machine with the kernel (KELM). Finally, the detection of NSDD was realized. Consequently, this study can guide the prevention of flash and configuration of external insulation in transmission lines.
- 1 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 19 (3) , 1734-1746
Mining Similar Aspects for Gene Similarity Explanation Based on Gene Information Network
Analysis of gene similarity not only can provide information on the understanding of the biological roles and functions of a gene, but may also reveal the relationships among various genes. In this paper, we introduce a novel idea of mining similar aspects from a gene information network, i.e., for a given gene pair, we want to know in which aspects (meta paths) they are most similar from the perspective of the gene information network. We defined a similarity metric based on the set of meta paths connecting the query genes in the gene information network and used the rank of similarity of a gene pair in a meta path set to measure the similarity significance in that aspect. A minimal set of gene meta paths where the query gene pair ranks the highest is a similar aspect, and the similar aspect of a query gene pair is far from trivial. We proposed a novel method, SCENARIO, to investigate minimal similar aspects. Our empirical study on the gene information network, constructed from six public gene-related databases, verified that our proposed method is effective, efficient, and useful.
- 1 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Computational Biology and Bioinformatics
- Vol. 19 (3) , 1734-1746
Mining Similar Aspects for Gene Similarity Explanation Based on Gene Information Network
Analysis of gene similarity not only can provide information on the understanding of the biological roles and functions of a gene, but may also reveal the relationships among various genes. In this paper, we introduce a novel idea of mining similar aspects from a gene information network, i.e., for a given gene pair, we want to know in which aspects (meta paths) they are most similar from the perspective of the gene information network. We defined a similarity metric based on the set of meta paths connecting the query genes in the gene information network and used the rank of similarity of a gene pair in a meta path set to measure the similarity significance in that aspect. A minimal set of gene meta paths where the query gene pair ranks the highest is a similar aspect, and the similar aspect of a query gene pair is far from trivial. We proposed a novel method, SCENARIO, to investigate minimal similar aspects. Our empirical study on the gene information network, constructed from six public gene-related databases, verified that our proposed method is effective, efficient, and useful.