167 citations · 367 across the 11 of their papers we have counts for
Showing stat.MLShow all
3 papers · 1 filter
stat.ML2016★ 5 cited
A Sub-Quadratic Exact Medoid Algorithm
James Newling, François Fleuret
We present a new algorithm, trimed, for obtaining the medoid of a set, that is the element of the set which minimises the mean distance to all other elements. The algorithm is show…
stat.ML2016★ 36 cited
Nested Mini-Batch K-Means
James Newling, François Fleuret
A new algorithm is proposed which accelerates the mini-batch k-means algorithm of Sculley (2010) by using the distance bounding approach of Elkan (2003). We argue that, when incorp…
stat.ML2016★ 41 cited
Fast K-Means with Accurate Bounds
James Newling, François Fleuret
We propose a novel accelerated exact k-means algorithm, which performs better than the current state-of-the-art low-dimensional algorithm in 18 of 22 experiments, running up to 3 t…