Comprehensible Counterfactual Explanation on Kolmogorov-Smirnov Test
Summary: Proposes most comprehensible counterfactual explanations for KS-test failures, encoding user domain knowledge to clarify why a test set fails. MOCHE (MOst CompreHensible Explanation) is an efficient algorithm that avoids exponential enumeration, guarantees optimal explanations, and scales to real datasets. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Zicun Cong (Simon Fraser University)
- 2. Lingyang Chu (McMaster University)
- 3. Yu Yang (City University of Hong Kong)
- 4. Jian Pei (Simon Fraser University)
BibTeX Citation
@article{cong_vldb21,
title = {{Comprehensible Counterfactual Explanation on Kolmogorov-Smirnov Test}},
author = {Cong, Zicun and Chu, Lingyang and Yang, Yu and Pei, Jian},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {9},
pages = {1583--1596},
doi = {10.14778/3461535.3461546},
url = {https://doi.org/10.14778/3461535.3461546},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,783 | Counterfactual Explanation of Shapley Value in Data Coalitions | 2024 | VLDB | 5.7758194e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 142 | LOF: Identifying Density-Based Local Outliers | 2000 | SIGMOD | 0.0002962566 |
| 310 | Order Preserving Encryption for Numeric Data | 2004 | SIGMOD | 0.00021766789 |
| 578 | Efficient Algorithms for Mining Outliers from Large Data Sets | 2000 | SIGMOD | 0.00016221871 |
| 1,326 | Resisting Structural Re-identification in Anonymized Social Networks | 2008 | VLDB | 0.00011145219 |
| 2,340 | Online Outlier Detection in Sensor Data Using Non-Parametric Models | 2006 | VLDB | 8.7246796e-05 |
| 2,346 | Series2Graph: Graph-based Subsequence Anomaly Detection for Time Series | 2020 | VLDB | 8.7168932e-05 |
| 3,670 | Learning to Validate the Predictions of Black Box Classifiers on Unseen Data | 2020 | SIGMOD | 7.2118928e-05 |
| 3,785 | Detecting Change in Data Streams | 2004 | VLDB | 7.1265312e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,534 | Exathlon: A Benchmark for Explainable Anomaly Detection over Time Series | 2021 | VLDB |
| 2 | 4,821 | Crowdsourced Top-k Queries by Confidence-Aware Pairwise Judgments | 2017 | SIGMOD |
| 3 | 2,195 | Explaining Query Answers with Explanation-Ready Databases | 2016 | VLDB |
| 4 | 8,229 | Mining Approximate Top-K Subspace Anomalies in Multi-Dimensional Time-Series Data | 2007 | VLDB |
| 5 | 3,000 | Explaining Black-Box Algorithms Using Probabilistic Contrastive Counterfactuals | 2021 | SIGMOD |
| 6 | 6,141 | An Experimental Evaluation of Anomaly Detection in Time Series | 2024 | VLDB |
| 7 | 9,914 | Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations | 2025 | PODS |
| 8 | 11,157 | Relative Keys: Putting Feature Explanation into Context | 2024 | SIGMOD |
| 9 | 11,170 | Counterfactual Explanation at Will, with Zero Privacy Leakage | 2024 | SIGMOD |
| 10 | 9,313 | Computing Rule-Based Explanations by Leveraging Counterfactuals | 2023 | VLDB |