CoChat

A Comprehensive Benchmark and Empirical Study of Trace Anomaly Detection

Sun, Yongqian, Shao, Minyi, Nie, Xiaohui, Yang, Kaiwen, Li, Xingda, Hao, Bowen, Zhang, Shenglin, Pei, Changhua, He, Dongbiao, Li, Yanbiao, Pei, Dan · 2025 · IEEE Transactions on Services Computing

The DOI matches its Crossref record; 22 of the 23 references it cites were found in a registry or an index, and 1 are not checked yet.

Abstract

The growing complexity of modern Internet applications and the widespread use of microservice architectures have amplified the need for efficient trace anomaly detection to maintain system stability. Despite the fact that many trace anomaly detection algorithms have been proposed to identify abnormal behaviors, a comprehensive evaluation of these methods is lacking, which makes it difficult for developers to choose the most suitable algorithm for real-world applications. To address this gap, we presentTADBench, a comprehensive and extensible benchmark for trace anomaly detection.TADBenchconsolidates diverse publicly available trace datasets and algorithms into a unified repository, standardizes data formats, and incorporates manual anomaly labels. To ensure reproducibility and fair comparisons, we propose a modular evaluation framework supporting end-to-end model assessment. Additionally, we provide practical guidance for algorithm selection based on specific data attributes by evaluating their performance across datasets with different characteristics, thereby effectively bridging the gap between academic research and industrial deployment. To the best of our knowledge, this is the first comprehensive empirical study of trace anomaly detection algorithms. Our findings aim to facilitate the adoption of these methods in production environments, offering actionable insights for developers and researchers.

Overview

Integrity signals

Registry

Crossref · 10.1109/tsc.2025.3622122

Cites

22 of 23 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 23 references

Research works printed but not linked: 11

  1. Kingma, 2014, Auto-encoding variational Bayes, 1
  2. 10.1109/issre5003.2020.00014 · DOI · Paper page
  3. Rezende, 2015, Variational inference with normalizing flows, 1530
  4. Zhang, 2022, CRISP: Critical path analysis of large-scale microservice architectures, 655
  5. Mitton, 2020, A graph VAE and graph transformer approach to generating molecular graphs, 1
  6. Veličković, 2018, Graph attention networks, 1
  7. Hamilton, 2017, Inductive representation learning on large graphs, 1025
  8. Kiryo, 2017, Positive-unlabeled learning with non-negative risk estimator, 1674
  9. Wolf, 2020, Transformers: State-of-the-art natural language processing, 38
  10. You, 2020, Graph contrastive learning with augmentations, 33, 5812
  11. Schölkopf, 1999, Support vector method for novelty detection, 12, 582

Cited by

See all 4

Metadata

Authors
Sun, Y., Shao, M., Nie, X., Yang, K., Li, X., Hao, B., Zhang, S., Pei, C., He, D., Li, Y., & Pei, D.
Affiliations
  • Nankai University (CN)
  • Chinese Academy of Sciences (CN)
  • Tsinghua University (CN)
Venue
IEEE Transactions on Services Computing
Published
2025-11
Volume
18
Issue
6
Pages
3364-3377
ISSN
  • 1939-1374 (ISSN-L)
  • 2372-0204
OpenAlex
W4415256963
Cited by
1
References
23
Citations by year
2026: 1
FWCI
0.42
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Services Computing (publishedVersion)
Funders
  • National Natural Science Foundation of China (62272249, 62302244)
  • Fundamental Research Funds for the Central Universities (XXX-63253249)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Software System Performance and Reliability
  • Physical Sciences › Computer Science › Artificial Intelligence › Anomaly Detection Techniques and Applications
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
Keywords
benchmark, microservices, distributed tracing, anomaly detection algorithms, algorithm evaluation, reproducibility, algorithm selection

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Comprehensive Benchmark and Empirical Study of Trace Anomaly Detection. https://app.cochat.ai/papers/10.1109/tsc.2025.3622122
The paper
Sun, Y., Shao, M., Nie, X., Yang, K., Li, X., Hao, B., Zhang, S., Pei, C., He, D., Li, Y., & Pei, D. (2025). A Comprehensive Benchmark and Empirical Study of Trace Anomaly Detection. IEEE Transactions on Services Computing. https://doi.org/10.1109/tsc.2025.3622122

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.