ExDBSCAN: Explaining DBSCAN with Counterfactual Reasoning -- Additional Material
arXiv:2605. 30225v2 Announce Type: replace Abstract: Clustering is an unsupervised technique for grouping data points by similarity.
arXiv:2607. 14719v1 Announce Type: new Abstract: Counterfactual explanations provide local, interpretable insight by identifying changes to an input that would alter its assigned outcome.
arXiv:2605. 30225v2 Announce Type: replace Abstract: Clustering is an unsupervised technique for grouping data points by similarity.
arXiv:2606. 04209v1 Announce Type: new Abstract: Counterfactual explanations seek small, semantically meaningful changes to an input that alter a model's prediction, and are widely used to interpret and audit machine learning systems.
FCx is a new algorithm that generates counterfactual explanations while explicitly enforcing feasibility constraints. It uses a modified Variational Autoencoder with a multi‑factor loss to produce realistic, low‑cost counterfactuals that satisfy both hard constraints supplied by users and soft constraints inferred via causal inference. Experiments on four public datasets demonstrate that FCx matches state‑of‑the‑art performance across multiple metrics while guaranteeing feasibility.
Counterfactual (CF) explanations identify changes that alter an input's classification. While existing methods produce realistic and low-cost CFs, they often fail to ensure feasibility, by suggesting...
arXiv:2607. 22045v1 Announce Type: new Abstract: Counterfactual explanations are a prominent approach in explainable artificial intelligence (xAI), providing actionable guidance on what input changes would alter a model's prediction to a desired outcome.
arXiv:2606. 14592v1 Announce Type: cross Abstract: Clustering is widely used for exploratory analysis and scientific discovery, driving insights from market segmentation to biological data analysis, but its outputs can be difficult to interpret, audit, and reproduce as modern datasets become increasingly large and complex.
arXiv:2509. 25289v4 Announce Type: replace-cross Abstract: Identifying an effective clustering algorithm for a given dataset remains a fundamental unsupervised learning issue.
arXiv:2607. 04949v1 Announce Type: new Abstract: We study the problem of k-means clustering on large datasets.
arXiv:2609.07917v1 Announce Type: cross Abstract: Counterfactual explanations formalize "what-if" scenarios by identifying modifications to an input instance that obtain a desired alternative predict...
The paper critiques the normalized edit distance metric used for evaluating lexicons derived from unsupervised word discovery, noting its bias toward large clusters and its failure to account for the distribution of true classes across clusters. It proposes two new metrics—one that weights cluster size when measuring within‑cluster consistency and another that evaluates how true words are spread across clusters—drawing on clustering theory. Experiments on synthetic and real‑world lexicons show that these combined metrics better correlate with ground‑truth distributions and are more robust to evaluation biases.
arXiv:2606. 05230v1 Announce Type: cross Abstract: Selecting a clustering algorithm and its hyperparameters without labels is a common difficulty in engineering machine learning pipelines that work with unsupervised analysis of sensor, image, or process data.
arXiv:2608. 25897v1 Announce Type: new Abstract: Explaining deep learning models operating on time series data is crucial in various applications that require transparent and interpretable insights into model behavior.