Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability (Q6334274)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability |
preprint article from arXiv |
Statements
6 February 2020
0 references
cs.DS
0 references
cs.AI
0 references
cs.DM
0 references
math.OC
0 references
Prathyush Sambaturu
0 references
Aparna Gupta
0 references
Ian Davidson
0 references
S. S. Ravi
0 references
Anil Vullikanti
0 references
Andrew Warren
0 references
