How to find a good explanation for clustering?
From MaRDI portal
Publication:6136087
DOI10.1016/j.artint.2023.103948arXiv2112.06580OpenAlexW4379055191MaRDI QIDQ6136087
Nidhi Purohit, William Lochet, Kirill Simonov, Fedor V. Fomin, Sayan Bandyapadhyay, Petr A. Golovach
Publication date: 28 August 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.06580
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interpretable clustering using unsupervised binary trees
- Fundamentals of parameterized complexity
- The planar \(k\)-means problem is NP-hard
- Supersparse linear integer models for optimized medical scoring systems
- Clustering large graphs via the singular value decomposition
- NP-hardness of Euclidean sum-of-squares clustering
- Generalized additive models
- Which problems have strongly exponential complexity?
- Interpretable clustering: an optimization approach
- Linear-time approximation schemes for clustering problems in any dimensions
- Kernelization
- Approximation Schemes for Clustering with Outliers
- A Lottery Model for Center-Type Problems With Outliers
- On Tackling Explanation Redundancy in Decision Trees
- On the Parameterized Complexity of Approximating Dominating Set
- Definitions, methods, and applications in interpretable machine learning
- Constant approximation for k-median and k-means with outliers via iterative rounding
- Parameterized Algorithms
- On the complexity of \(k\)-SAT
- Random forests
This page was built for publication: How to find a good explanation for clustering?