Landmark Block-Embedded Aggregation Autoencoder for Anomaly Detection
Bibliographic record
Abstract
Unsupervised anomaly detection (AD) methods based on deep learning have attracted great attention in unlabeled data mining. The performance of these AD methods usually depends on the representation ability of normal patterns and the quality of training data. However, most deep unsupervised AD methods do not capture the distribution characteristics and the diversity of normal patterns effectively. In the meantime, they ignore the interference of abnormal samples on the model in training data with anomaly contamination. To tackle these issues, this article proposes a method named landmark block-embedded aggregation autoencoder (LBAA) for AD. LBAA constructs a filter and an aggregation autoencoder by introducing a novel normal feature learning approach to improve data quality and adjust its distribution differences from anomalies. In the normal feature learning, we define a landmark block to represent distribution of a normal class and an adaptive selection mechanism of landmark blocks’ number to obtain diverse normal features. On the basis, the filter is constructed to filter distinct anomalies and improve the quality of the contaminated training data. Then, a weighted objective function is proposed to train the aggregation autoencoder. The function can reduce the interference of anomalies and realize the aggregation of normal samples to increase the feature differences between normal and abnormal samples. Next, the trained aggregation autoencoder calculates the anomaly score of each sample by summing the reconstruction error and its median sparseness to the landmark blocks. Finally, we report on a comprehensive experiment on multiple datasets. The obtained results validate the effectiveness and robustness of LBAA.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".