
On the price of explainability for some clustering problems
The price of explainability for a clustering task can be defined as the ...
read it

Speeding up Word Mover's Distance and its variants via properties of distances between embeddings
The Word Mover's Distance (WMD) proposed in Kusner et al. [ICML,2015] is...
read it

Information theoretical clustering is hard to approximate
An impurity measures I: R^d R^+ is a function that assigns a ddimension...
read it

Approximation Algorithms for Clustering via Weighted Impurity Measures
An impurity measures I:R^k →R^+ maps a kdimensional vector v to a non...
read it

Decision Trees for Function Evaluation  Simultaneous Optimization of Worst and Expected Cost
In several applications of automatic diagnosis and active learning a cen...
read it
Eduardo Laber
is this you? claim profile