DCSO: Dynamic Combination of Detector Scores for Outlier Ensembles
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
A Knowledge Distillation Ensemble Framework for Predicting Short and Long-term Hospitalisation Outcomes from Electronic Health Records Data
SUOD: Accelerating Large-Scale Unsupervised Heterogeneous Outlier Detection
PyOD: A Python Toolbox for Scalable Outlier Detection
LSCP: Locally Selective Combination in Parallel Outlier Ensembles
Graph-based Selective Outlier Ensembles
Sequential Ensemble Learning for Outlier Detection: A Bias-Variance Perspective
토론
이 논문과 연결된 포럼 글이 아직 없습니다.