Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations
Summary: Explores feature-level explanations for k-NN, introducing abductive minimum-sufficient-reason explanations and counterfactual explanations for classifications. Charts a complexity landscape across discrete vs continuous features and distance functions, and enables practical computation via Integer Quadratic Programming and SAT. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,269 | Database Views as Explanations for Relational Deep Learning | 2026 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 48 | Nearest Neighbor Queries | 1995 | SIGMOD | 0.0006954126 |
| 675 | Quality and Efficiency in High Dimensional Nearest Neighbor Search | 2009 | SIGMOD | 0.00018304179 |
| 2,099 | What is the nearest neighbor in high dimensional spaces? | 2000 | VLDB | 9.5429949e-05 |
| 4,026 | Parallel Algorithms for Constructing Range and Nearest-Neighbor Searching Data Structures | 2016 | PODS | 6.5166769e-05 |
| 4,721 | Nearest-Neighbor Searching Under Uncertainty | 2012 | PODS | 5.9647585e-05 |
| 7,080 | Nearest Neighbor Searching Under Uncertainty II | 2013 | PODS | 4.8353058e-05 |
Previous
Page 1 / 1
Next