Unsupervised Multivariate Time Series Data Anomaly Detection in Industrial IoT: A Confidence Adversarial Autoencoder Network
Bibliographic record
Abstract
Anomaly detection of multivariate time series (MTS) is crucial in industrial intelligent systems. To address the challenges of absence of anomaly labels, fast inference time, multi-source and multi-modality in anomaly detection, researchers have primarily investigated unsupervised reconstruction-driven methods. However, the existing reconstruction-driven methods mainly focus on minimizing reconstruction errors while neglecting the importance of training methods that increase errors between normal and abnormal classes. Furthermore, accurately constructing the feature space of normal and abnormal classes during the reconstruction process remains a challenge. In this paper, we propose an innovative model, namely the confidence adversarial autoencoder (CAAE). The proposed CAAE combines a confidence network, based on window credibility judgment, with an autoencoder to provide credibility support for anomaly detection. We further introduce fake labels to provide the confidence network with a discriminative knowledge for identifying reconstructed data. Additionally, we implement the confidence adversarial training method to generate fake labels to construct an adversarial loss aiming to expand the decision boundary of anomaly scores. Extensive experimental results on publicly available time series datasets are provided to demonstrate the efficiency of our proposed CAAE. It reveals that excellent generalization ability and superior average performance are achieved on different datasets compared with the state-of-the-art methods.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.011 | 0.003 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".