Ensemble algorithms for unsupervised anomaly detection

14Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many anomaly detection algorithms have been proposed in recent years, including density-based and rank-based algorithms. In this paper, we propose ensemble methods to improve the performance of these individual algorithms. We evaluate approaches that use score and rank aggregation for these algorithms. We also consider sequential methods in which one detection method is followed by the other. We use several datasets to evaluate the performance of the proposed ensemble methods. Our results show that sequential methods significantly improve the ability to detect anomalous data points.

Cite

CITATION STYLE

APA

Zhao, Z., Mehrotra, K. G., & Mohan, C. K. (2015). Ensemble algorithms for unsupervised anomaly detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9101, pp. 514–525). Springer Verlag. https://doi.org/10.1007/978-3-319-19066-2_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free