14 citations · 45 across the 13 of their papers we have counts for
15 papers
Optimization of Inter-group Criteria for Clustering with Minimum Size Constraints
Eduardo S. Laber, Lucas Murtinho
Internal measures that are used to assess the quality of a clustering usually take into account intra-group and/or inter-group criteria. There are many papers in the literature tha…
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…
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…
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…
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…
Speeding up Word Mover's Distance and its variants via properties of distances between embeddings
Matheus Werner, Eduardo Laber
The Word Mover's Distance (WMD) proposed by Kusner et al. is a distance between documents that takes advantage of semantic relations among words that are captured by their embeddin…