167 citations · 273 across the 8 of their papers we have counts for
11 papers
K-Medoids For K-Means Seeding
James Newling, François Fleuret
We run experiments showing that algorithm clarans (Ng et al., 2005) finds better K-medoids solutions than the Voronoi iteration algorithm. This finding, along with the similarity b…
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…
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…
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…
Towards the Future of Supernova Cosmology
Michelle Lochner, Bruce A. Bassett, Melvin Varughese +4
For future surveys, spectroscopic follow-up for all supernovae will be extremely difficult. However, one can use light curve fitters, to obtain the probability that an object is a…
BEAMS: separating the wheat from the chaff in supernova analysis
Martin Kunz, Renée Hlozek, Bruce A. Bassett +3
We introduce Bayesian Estimation Applied to Multiple Species (BEAMS), an algorithm designed to deal with parameter estimation when using contaminated data. We present the algorithm…