Pith. sign in

REVIEW 2 cited by

Bayesian Anomaly Detection and Classification

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 1902.08627 v1 pith:W3ZGD6QG submitted 2019-02-22 stat.ML cs.AIcs.LG

classification stat.MLcs.AIcs.LG
keywords badacdetectionanomalyclassificationalgorithmsbayesiandatastatistical
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Statistical uncertainties are rarely incorporated in machine learning algorithms, especially for anomaly detection. Here we present the Bayesian Anomaly Detection And Classification (BADAC) formalism, which provides a unified statistical approach to classification and anomaly detection within a hierarchical Bayesian framework. BADAC deals with uncertainties by marginalising over the unknown, true, value of the data. Using simulated data with Gaussian noise, BADAC is shown to be superior to standard algorithms in both classification and anomaly detection performance in the presence of uncertainties, though with significantly increased computational cost. Additionally, BADAC provides well-calibrated classification probabilities, valuable for use in scientific pipelines. We show that BADAC can work in online mode and is fairly robust to model errors, which can be diagnosed through model-selection methods. In addition it can perform unsupervised new class detection and can naturally be extended to search for anomalous subsets of data. BADAC is therefore ideal where computational cost is not a limiting factor and statistical rigour is important. We discuss approximations to speed up BADAC, such as the use of Gaussian processes, and finally introduce a new metric, the Rank-Weighted Score (RWS), that is particularly suited to evaluating the ability of algorithms to detect anomalies.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Real-Time Outlier Connections Detection in Databases Network Traffic

    cs.DB 2025-01 reject novelty 3.0 of 10

    A real-time database outlier detection method hashes connection parameters and uses a coupon collector style inequality to decide when the learning phase ends, but the confidence claim rests on a flawed derivation.

  2. Data challenges as a tool for time-domain astronomy

    astro-ph.IM 2019-08 unverdicted novelty 1.0 of 10

    A review of time-domain astronomy data challenges, focused on the PLAsTiCC classification challenge and its evaluation metrics.

Pith tools