COPOD: Copula-Based Outlier Detection
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
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 an 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, parameter-free 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nelsen, R. B. (1999) · Lecture Notes in Statistics · doi:10.1007/978-1-4757-3076-0 · Cited by 7,744
Estimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 1×
“Numerous algorithms have been proposed over the last decades, which includes covariance based models like Outlier Detection with Minimum Covariance Determinant (MCD) [3], proximity based models like k-Nearest Neighbors Detector (kNN) [4], linear models like One-class SVM detector [5], ensemble base models like Locally…”
MethodA Fast Algorithm for the Minimum Covariance Determinant Estimator
Rousseeuw, P. J., & Driessen, K. V. (1999) · Technometrics · doi:10.1080/00401706.1999.10485670 · Cited by 2,708
Efficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335437 · Cited by 1,860
Efficient algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335437 · Cited by 1,171
On the evaluation of unsupervised outlier detection: measures, datasets, and an empirical study
Campos, G. O., Zimek, A., Sander, J., Campello, R. J. G. B., Micenková, B., Schubert, E., Assent, I., & Houle, M. E. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-015-0444-8 · Cited by 735
Generative Adversarial Active Learning for Unsupervised Outlier Detection
Liu, Y., Li, Z., Zhou, C., Jiang, Y., Sun, J., Wang, M., & He, X. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2019.2905606 · Cited by 335
Self-citationXGBOD: Improving Supervised Outlier Detection with Unsupervised Representation Learning
Zhao, Y., & Hryniewicki, M. K. (2018) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2018.8489605 · Cited by 208
Self-citationLSCP: Locally Selective Combination in Parallel Outlier Ensembles
Zhao, Y., Nasrullah, Z., Hryniewicki, M. K., & Li, Z. (2019) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611975673.66 · Cited by 160
Self-citationSUOD: Accelerating Large-Scale Unsupervised Heterogeneous Outlier DetectionPreprint
Zhao, Y., Hu, X., Cheng, C., Wang, C., Wan, C., Wang, W., Yang, J., Bai, H., Li, Z., Xiao, C., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.05731 · Cited by 63
Self-citationAutoOD: Automated Outlier Detection via Curiosity-guided Search and Self-imitation LearningPreprint
Li, Y., Chen, Z., Zha, D., Zhou, K., Jin, H.-F., Chen, H.-F., & Hu, X. (2020) · arXiv.org · doi:10.48550/arxiv.2006.11321 · Cited by 20
Self-citationSynC: A Unified Framework for Generating Synthetic Population with Gaussian CopulaPreprint
Wan, C., Li, Z., Guo, A., & Zhao, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.07998 · Cited by 5
Self-citation
Cited by
Anomaly detection in time series: a comprehensive evaluation
Schmidl, S., Wenig, P., & Papenbrock, T. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3538598.3538602 · Cited by 590
Self-Supervised Random Forest on Transformed Distribution for Anomaly Detection
Liu, J., Wang, H., Hang, H., Ma, S., Shen, X., & Shi, Y. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3348833 · Cited by 28
“7) COPOD [40], parameter-free method which first constructs an empirical copula, and then uses it to predict tail probabilities of each given data point to determine its level of “extremeness.””
Insider Threat Detection Using An Unsupervised Learning Method: COPOD
Sun, X., Wang, Y., & Shi, Z. (2021) · 2021 International Conference on Communications, Information System and Computer Engineering (CISCE) · doi:10.1109/cisce52179.2021.9445898 · Cited by 21
“It is an outlier detection algorithm proposed by Li in 2020 [22].”
Method
Metadata
- Authors
- Li, Z., Zhao, Y., Botta, N., Ionescu, C., & Hu, X.
- Venue
- 2020 IEEE International Conference on Data Mining (ICDM)
- Publisher
- IEEE
- Published
- 2020-11
- Pages
- 1118-1123
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W3087668759
- Cited by
- 387
- References
- 12
- FWCI
- 17.03
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.