2014
DOI: 10.1145/2594473.2594476
|View full text |Cite
|
Sign up to set email alerts
|

Ensembles for unsupervised outlier detection

Abstract: Ensembles for unsupervised outlier detection is an emerging topic that has been neglected for a surprisingly long time (although there are reasons why this is more difficult than supervised ensembles or even clustering ensembles). Aggarwal recently discussed algorithmic patterns of outlier detection ensembles, identified traces of the idea in the literature, and remarked on potential as well as unlikely avenues for future transfer of concepts from supervised ensembles. Complementary to his points, here we focu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
88
0
2

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 219 publications
(90 citation statements)
references
References 73 publications
(61 reference statements)
0
88
0
2
Order By: Relevance
“…For better comparability of the algorithms' outputs, we rank them by computing the percentiles of the algorithm scores. These are then aggregated into ensemble scores by computing the minimum (consensus voting), the mean (balanced voting), or the maximum (risky voting) of the scores of selected well-performing algorithms (e.g., Aggarwal, 2012;Zimek et al, 2013).…”
Section: Ensembles Of Anomaly Detection Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…For better comparability of the algorithms' outputs, we rank them by computing the percentiles of the algorithm scores. These are then aggregated into ensemble scores by computing the minimum (consensus voting), the mean (balanced voting), or the maximum (risky voting) of the scores of selected well-performing algorithms (e.g., Aggarwal, 2012;Zimek et al, 2013).…”
Section: Ensembles Of Anomaly Detection Algorithmsmentioning
confidence: 99%
“…The selection of algorithms for computing the ensemble is a compromise between accurate detection of and diversity amongst the selected algorithms (Zimek et al, 2013). We select the four best algorithms (KDE, REC, KNN-Gamma, T 2; referred to together as 4b) and the three best distance-based algorithms (KDE, REC, KNN-Gamma; referred to together as 3d) for computing their ensembles.…”
Section: Ensemblesmentioning
confidence: 99%
See 1 more Smart Citation
“…Contrasting to these work which aims to improve the scalability in traditional k NN methods via subsampling, ZERO++ utilises the probability of zero appearances to introduce a new anomaly scoring measure. Also, they operate in a single subsample only and use the full dimensionality to compute the kth-NN distance, which can lead to unstable detection performance and have the curse of dimensionality problem in high-dimensional data (Zimek, Campello, & Sander, 2013a), while ZERO++ builds a set of models in a set of subsamples and subspaces.…”
Section: Methods For Numeric Datamentioning
confidence: 99%
“…These issues are interrelated and refer to the problems of model selection and assessment (evaluation or validation) of results in unsupervised learning. These problems have been investigated for decades in the area of unsupervised data clustering [14], but are rarely mentioned and are virtually untouched in the area of outlier detection [43].…”
Section: Ssdbm '15mentioning
confidence: 99%