research
∙
02/04/2022
Time-Constrained Learning
Consider a scenario in which we have a huge labeled dataset D and a limi...
share
research
∙
12/29/2021
Shallow decision trees for explainable k-means clustering
A number of recent works have employed decision trees for the constructi...
research
∙
01/05/2021
On the price of explainability for some clustering problems
The price of explainability for a clustering task can be defined as the ...
research
∙
12/01/2019
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...
research
∙
12/17/2018
Information theoretical clustering is hard to approximate
An impurity measures I: R^d R^+ is a function that assigns a d-dimension...
research
∙
07/13/2018
Approximation Algorithms for Clustering via Weighted Impurity Measures
An impurity measures I:R^k →R^+ maps a k-dimensional vector v to a non-...
research
∙
09/11/2013