English

DCSO: Dynamic Combination of Detector Scores for Outlier Ensembles

Machine Learning 2019-11-26 v1 Databases Information Retrieval Machine Learning

Abstract

Selecting and combining the outlier scores of different base detectors used within outlier ensembles can be quite challenging in the absence of ground truth. In this paper, an unsupervised outlier detector combination framework called DCSO is proposed, demonstrated and assessed for the dynamic selection of most competent base detectors, with an emphasis on data locality. The proposed DCSO framework first defines the local region of a test instance by its k nearest neighbors and then identifies the top-performing base detectors within the local region. Experimental results on ten benchmark datasets demonstrate that DCSO provides consistent performance improvement over existing static combination approaches in mining outlying objects. To facilitate interpretability and reliability of the proposed method, DCSO is analyzed using both theoretical frameworks and visualization techniques, and presented alongside empirical parameter setting instructions that can be used to improve the overall performance.

Keywords

Cite

@article{arxiv.1911.10418,
  title  = {DCSO: Dynamic Combination of Detector Scores for Outlier Ensembles},
  author = {Yue Zhao and Maciej K. Hryniewicki},
  journal= {arXiv preprint arXiv:1911.10418},
  year   = {2019}
}

Comments

ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), Outlier Detection De-constructed Workshop, 2018