14 citations · 45 across the 13 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.DS2018
Information theoretical clustering is hard to approximate
Ferdinando Cicalese, Eduardo Laber
An impurity measures is a function that assigns a -dimensional vector to a non-negative value so that the more homo…
cs.DS2018★ 2 cited
Minimization of Gini impurity via connections with the k-means problem
Eduardo Sany Laber, Lucas Murtinho
The Gini impurity is one of the measures used to select attribute in Decision Trees/Random Forest construction. In this note we discuss connections between the problem of computing…
cs.DS2018★ 3 cited
Approximation Algorithms for Clustering via Weighted Impurity Measures
Ferdinando Cicalese, Eduardo Laber
An impurity measures maps a -dimensional vector to a non-negative value so that the more homogeneous , the larger its impurit…