Pith. sign in

REVIEW 1 cited by

TreeMIL: A Multi-instance Learning Framework for Time Series Anomaly Detection with Inexact Supervision

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.11235 v1 pith:7GUMBXXS submitted 2024-01-20 cs.LG cs.AI

classification cs.LGcs.AI
keywords anomaliesanomalyseriestimetreemilcollectivedetectiondifferent
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Time series anomaly detection (TSAD) plays a vital role in various domains such as healthcare, networks, and industry. Considering labels are crucial for detection but difficult to obtain, we turn to TSAD with inexact supervision: only series-level labels are provided during the training phase, while point-level anomalies are predicted during the testing phase. Previous works follow a traditional multi-instance learning (MIL) approach, which focuses on encouraging high anomaly scores at individual time steps. However, time series anomalies are not only limited to individual point anomalies, they can also be collective anomalies, typically exhibiting abnormal patterns over subsequences. To address the challenge of collective anomalies, in this paper, we propose a tree-based MIL framework (TreeMIL). We first adopt an N-ary tree structure to divide the entire series into multiple nodes, where nodes at different levels represent subsequences with different lengths. Then, the subsequence features are extracted to determine the presence of collective anomalies. Finally, we calculate point-level anomaly scores by aggregating features from nodes at different levels. Experiments conducted on seven public datasets and eight baselines demonstrate that TreeMIL achieves an average 32.3% improvement in F1- score compared to previous state-of-the-art methods. The code is available at https://github.com/fly-orange/TreeMIL.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Noise-Resilient Point-wise Anomaly Detection in Time Series Using Weak Segment Labels

    cs.LG 2025-01 conditional novelty 5.0 of 10

    NRdetector combines positive-unlabeled learning, confidence-based sample selection, and a temporal smoothness-and-separability loss to predict point-level anomalies from noisy segment labels, and reports the best F1 o...

Pith tools