Deutsch
 
Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Buchkapitel

COPOD: Copula-Based Outlier Detection

Urheber*innen

Li,  Zheng
External Organizations;

Zhao,  Yue
External Organizations;

/persons/resource/nicola.botta

Botta,  Nicola
Potsdam Institute for Climate Impact Research;

Ionescu,  Cezar
Potsdam Institute for Climate Impact Research;

Hu,  Xiyang
External Organizations;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte in PIKpublic verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Li, Z., Zhao, Y., Botta, N., Ionescu, C., Hu, X. (2020): COPOD: Copula-Based Outlier Detection. - In: Plant, C., Wang, H., Cuzzocrea, A., Zaniolo, C., Wu, X. (Eds.), IEEE International Conference on Data Mining (ICDM), Piscataway, NJ : IEEE, 1118-1123.
https://doi.org/10.1109/ICDM50108.2020.00135


Zitierlink: https://publications.pik-potsdam.de/pubman/item/item_24536
Zusammenfassung
Outlier detection refers to the identification of rare items that are deviant from the general data distribution. Existing approaches suffer from high computational complexity, low predictive capability, and limited interpretability. As a remedy, we present a novel outlier detection algorithm called COPOD, which is inspired by copulas for modeling multivariate data distribution. COPOD first constructs a empirical copula, and then uses it to predict tail probabilities of each given data point to determine its level of “extremeness”. Intuitively, we think of this as calculating an anomalous p-value. This makes COPOD both parameter-free, highly interpretable, and computationally efficient. In this work, we make three key contributions, 1) propose a novel, parameterfree outlier detection algorithm with both great performance and interpretability, 2) perform extensive experiments on 30 benchmark datasets to show that COPOD outperforms in most cases and is also one of the fastest algorithms, and 3) release an easy-to-use Python implementation for reproducibility.