On Variants of k-means Clustering

Pattern classification and scene analysis

Richard O Duda, Peter E Hart, et al · 1973

Earlier work this paper cites.

Indexing by latent semantic analysis

Scott C. Deerwester, Susan T. Dumais, Thomas K. Landauer, George W. Furnas, and Richard A. Harshman · 1990

Earlier work this paper cites.

Finding Groups in Data: An Introduction to Cluster Analysis

L. Kaufman and Peter J. Rousseeuw · 1990

Earlier work this paper cites.

Color indexing

Original

Michael J. Swain and Dana H. Ballard · 1991

Earlier work this paper cites.

Efficient and effective querying by image content

Christos Faloutsos, Ron Barber, Myron Flickner, Jim Hafner, Wayne Niblack, Dragutin Petkovic, and William Equitz · 1994

Earlier work this paper cites.

Applications of weighted voronoi diagrams and randomization to variance-based k -clustering (extended abstract)

Mary Inaba, Naoki Katoh, and Hiroshi Imai · 1994

Earlier work this paper cites.

Advances in Knowledge Discovery and Data Mining

Usama M. Fayyad, Gregory Piatetsky-Shapiro, Padhraic Smyth, and Ramasamy Uthurusamy, editors · 1996

Earlier work this paper cites.

Syntactic clustering of the web

Andrei Z. Broder, Steven C. Glassman, Mark S. Manasse, and Geoffrey Zweig · 1997

Earlier work this paper cites.

Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems

Sanjeev Arora · 1998

Earlier work this paper cites.

Approximation schemes for euclidean k-medians and related problems

Sanjeev Arora, Prabhakar Raghavan, and Satish Rao · 1998

Earlier work this paper cites.

Data clustering: A review

Anil K. Jain, M. Narasimha Murty, and Patrick J. Flynn · 1999

Cited alongside, same era.

Statistical pattern recognition: A review

Anil K. Jain, Robert P. W. Duin, and Jianchang Mao · 2000

Cited alongside, same era.

On approximate geometric k-clustering

Jirí Matousek · 2000

Cited alongside, same era.

Local search heuristics for k-median and facility location problems

Vijay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh Munagala, and Vinayaka Pandit · 2004

Cited alongside, same era.

On coresets for k-means and k-median clustering

Sariel Har-Peled and Soham Mazumdar · 2004

Cited alongside, same era.

A local search approximation algorithm for k-means clustering

Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine D. Piatko, Ruth Silverman, and Angela Y. Wu · 2004

Cited alongside, same era.

Np-hardness of euclidean sum-of-squares clustering

Daniel Aloise, Amit Deshpande, Pierre Hansen, and Preyas Popat · 2009

Later among the works it cites.

PTAS for geometric hitting set problems via local search

Nabil H. Mustafa and Saurabh Ray · 2009

Later among the works it cites.

Stability yields a PTAS for k-median and k-means clustering

Pranjal Awasthi, Avrim Blum, and Or Sheffet · 2010

Later among the works it cites.

Approximation algorithms for maximum independent set of pseudo-disks

Timothy M. Chan and Sariel Har-Peled · 2012

Later among the works it cites.

The planar k-means problem is np-hard

Meena Mahajan, Prajakta Nimbhorkar, and Kasturi R. Varadarajan · 2012

Later among the works it cites.

The effectiveness of lloyd-type methods for the k-means problem

Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulman, and Chaitanya Swamy · 2012

Later among the works it cites.