mlsanityData to 14 Oct 2026

A Mallows-like Criterion for Anomaly Detection with Random Forest Implementation

arXiv 2405.18932 ↗First posted 29 May 2024stat.ML cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

The effectiveness of anomaly signal detection can be significantly undermined by the inherent uncertainty of relying on one specified model. Under the framework of model average methods, this paper proposes a novel criterion to select the weights on aggregation of multiple models, wherein the focal loss function accounts for the classification of extremely imbalanced data. This strategy is further integrated into Random Forest algorithm by replacing the conventional voting method. We have evaluated the proposed method on benchmark datasets across various domains, including network intrusion. The findings indicate that our proposed method not only surpasses the model averaging with typical loss functions but also outstrips common anomaly detection algorithms in terms of accuracy and robustness.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 45 references that are in the map. First posted on arXiv 29 May 2024.

Builds on

4 of 45 references.

References · 4

  1. 2021SQUID: Deep Feature In-Painting for Unsupervised Anomaly Detectioncited by 34
  2. 2018Efficient Decentralized Deep Learning by Dynamic Model Averagingcited by 30
  3. 2017Deep Learning for Unsupervised Insider Threat Detection in Structured Cybersecurity Data Streamscited by 19
  4. 2018Focal Loss in 3D Object Detectioncited by 8

Built on by

Not cited yet.