14 citations · 45 across the 13 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LG2022
The computational complexity of some explainable clustering problems
Eduardo Sany Laber
We study the computational complexity of some explainable clustering problems in the framework proposed by [Dasgupta et al., ICML 2020], where explainability is achieved via axis-a…
cs.LG2022
Time-Constrained Learning
Sergio Filho, Eduardo Laber, Pedro Lazera +1
Consider a scenario in which we have a huge labeled dataset and a limited time to train some given learner using . Since we may not be able to use the whole da…