Toggle navigation
OpenReview
.net
Login
×
Go to
ICML 2021
homepage
On the price of explainability for some clustering problems
Eduardo Sany Laber
,
Lucas Murtinho
2021 (modified: 17 Apr 2023)
ICML 2021
Readers:
Everyone
Abstract:
The price of explainability for a clustering task can be defined as the unavoidable loss, in terms of the objective function, if we force the final partition to be explainable. Here, we study this ...
0 Replies
Loading