Discriminative features for identifying and interpreting outliers
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
We consider the problem of outlier detection and interpretation. While most existing studies focus on the first problem, we simultaneously address the equally important challenge of outlier interpretation. We propose an algorithm that uncovers outliers in subspaces of reduced dimensionality in which they are well discriminated from regular objects while at the same time retaining the natural local structure of the original data to ensure the quality of outlier explanation. Our algorithm takes a mathematically appealing approach from the spectral graph embedding theory and we show that it achieves the globally optimal solution for the objective of subspace learning. By using a number of real-world datasets, we demonstrate its appealing performance not only w.r.t. the outlier detection rate but also w.r.t. the discriminative human-interpretable features. This is the first approach to exploit discriminative features for both outlier detection and interpretation, leading to better understanding of how and why the hidden outliers are exceptional.
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
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687 · cited 1×
“The problem of outlier detection in various application domains attracted significant research effort [11].”
BackgroundLOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
Self-citationLOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · Proceedings of the 2000 ACM SIGMOD international conference on Management of data · doi:10.1145/342009.335388 · Cited by 4,149 · cited 9×
“Depending on whether the labels for outliers (or inliers) are available or not, the algorithms can be classified as supervised [35], semi-supervised [15], or unsupervised [9] techniques.”
BackgroundMethodInfluentialSelf-citationEfficient 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 · cited 1×
“In other studies [30], a similar definition is used where an object is viewed as an outlier if its distance to the k-th nearest neighbor is sufficiently large, usually greater than a given threshold d.”
BackgroundA survey on unsupervised outlier detection in high‐dimensional numerical data
Zimek, A., Schubert, E., & Kriegel, H. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11161 · Cited by 864 · cited 4×
“Here, we focus on the unsupervised setting on numerical high dimensional datasets [37].”
BackgroundResultInfluentialSelf-citationStatistical selection of relevant subspace projections for outlier ranking
Muller, E., Schiffer, M., & Seidl, T. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767916 · Cited by 126
Cited by
Hierarchical Density Estimates for Data Clustering, Visualization, and Outlier Detection
Campello, R. J. G. B., Moulavi, D., Zimek, A., & Sander, J. (2015) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2733381 · Cited by 915
“2013; Dang et al. 2014], see the survey of Zimek et al. [2012].”
BackgroundSelf-citationA Unifying Review of Deep and Shallow Anomaly Detection
Ruff, L., Kauffmann, J. R., Vandermeulen, R. A., Montavon, G., Samek, W., Kloft, M., Dietterich, T. G., & Muller, K.-R. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3052449 · Cited by 914
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
Self-citationEnsembles for unsupervised outlier detection: challenges and research questions a position paper
Zimek, A., Campello, R. J. G. B., & Sander, J. (2014) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2594473.2594476 · Cited by 278
Self-citationA Survey on Explainable Anomaly Detection
Li, Z., Zhu, Y., & Van Leeuwen, M. (2024) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3609333 · Cited by 139
“[52] leverage spectral graph theory to achieve subspace anomaly detection.”
BackgroundDiscovering outlying aspects in large datasets
Vinh, N. X., Chan, J., Romano, S., Bailey, J., Leckie, C., Ramamohanarao, K., & Pei, J. (2016) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0453-2 · Cited by 83
“Implementations of LOGP (Matlab) and GlobalFS (C++) were kindly provided by the respective authors (Dang et al. 2014; Vinh et al. 2014b).”
BackgroundMethodInfluentialA survey on outlier explanations
Panjei, E., Gruenwald, L., Leal, E., Nguyen, C., & Silvia, S. (2022) · The VLDB Journal · doi:10.1007/s00778-021-00721-1 · Cited by 67
“LGOP [24] focuses on identifying and interpreting local outliers using a graph-based model to capture the local geometry.”
BackgroundMethodInfluentialPang, G., Cao, L., Chen, L., Lian, D., & Liu, H. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11692 · Cited by 59
Yepmo, V., Smits, G., & Pivert, O. (2022) · Data & Knowledge Engineering · doi:10.1016/j.datak.2021.101946 · Cited by 52
“Local Outlier Detection with Interpretation (LODI) [37] and Local Outliers with Graph Projection (LOGP) [38] identify outliers in subspaces of the original feature space and in subspaces of a transformation of the original feature space respectively, like SOD and COP that were introduced in the…”
Sequential Feature Explanations for Anomaly Detection
Siddiqui, M. A., Fern, A., Dietterich, T. G., & Wong, W.-K. (2019) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3230666 · Cited by 50
“tions methods in both supervised and unsupervised settings are typically quite limited in their scope. Often evaluations are limited to visualizations or illustrations of several example explanations [2, 7] or to testing whether a computed explanation collectively conforms to some known concept in the data set [2], of…”
BackgroundOutlying property detection with numerical attributes
Angiulli, F., Fassetti, F., Manco, G., & Palopoli, L. (2017) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-016-0458-x · Cited by 33
“…a database DB on a set of attributes A , and parameters σ θ ∈ [0 , 1] and Ω θ ∈ [0 , 1], the problem of interest here is: Find the pairs ( E, p ) , with E ⊆ A and p ∈ A \ E , such that E is a σ θ -explanation and The pair ( E, p ) is also called an ( outlier ) explanation-property pair of o in DB .”
BackgroundExplainable outlier detection: What, for Whom and Why?
Sejr, J. H., & Schneider-Kamp, A. (2021) · Machine Learning with Applications · doi:10.1016/j.mlwa.2021.100172 · Cited by 32
A Comprehensive Survey on Outlying Aspect Mining Methods
Samariya, D., Ma, J., & Aryal, S. (2020) · arXiv · doi:10.48550/arxiv.2005.02637 · Cited by 3
“In 2014, [6] introduced LOGP which stands for Local Outliers with Graph Projection.”
BackgroundMethod
Metadata
- Authors
- Dang, X. H., Assent, I., Ng, R. T., Zimek, A., & Schubert, E.
- Venue
- 2014 IEEE 30th International Conference on Data Engineering
- Publisher
- IEEE
- Published
- 2014-03
- Pages
- 88-99
- ISSN
- 1084-4627 (ISSN-L)
- OpenAlex
- W2067092965
- Cited by
- 76
- References
- 6
- FWCI
- 5.34
- Type
- conference paper
- Language
- en
- Open access
- closed
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.