TL;DR
This paper introduces CHAODA, a novel hierarchical anomaly detection algorithm that leverages manifold mapping and transfer learning to effectively identify outliers in high-dimensional, large-scale datasets across various domains.
Contribution
The paper presents CHAODA, a new hierarchical anomaly detection method that generalizes across datasets and scales to big data, outperforming existing algorithms in diverse scenarios.
Findings
CHAODA outperforms state-of-the-art methods on 16 of 18 datasets.
CLAM efficiently maps high-dimensional data to manifolds.
The approach scales well to large, high-dimensional datasets.
Abstract
Anomaly and outlier detection is a long-standing problem in machine learning. In some cases, anomaly detection is easy, such as when data are drawn from well-characterized distributions such as the Gaussian. However, when data occupy high-dimensional spaces, anomaly detection becomes more difficult. We present CLAM (Clustered Learning of Approximate Manifolds), a manifold mapping technique in any metric space. CLAM begins with a fast hierarchical clustering technique and then induces a graph from the cluster tree, based on overlapping clusters as selected using several geometric and topological features. Using these graphs, we implement CHAODA (Clustered Hierarchical Anomaly and Outlier Detection Algorithms), exploring various properties of the graphs and their constituent clusters to find outliers. CHAODA employs a form of transfer learning based on a training set of datasets, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
