6 citations · 9 across the 4 of their papers we have counts for
Showing 2021 · cs.LGShow all
2 papers · 2 filters
cs.LG2021★ 6 cited
Shallow decision trees for explainable -means clustering
Eduardo Laber, Lucas Murtinho, Felipe Oliveira
A number of recent works have employed decision trees for the construction of explainable partitions that aim to minimize the -means cost function. These works, however, largely…
cs.LG2021★ 1 cited
On the price of explainability for some clustering problems
Eduardo Laber, Lucas Murtinho
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…