Fast K-Means Clustering with Anderson Acceleration

Iterative procedures for nonlinear integral equations

Anderson, D. G. (1965) · 1965

Earlier work this paper cites.

Convergence properties of the k-means algorithms

Bottou, L. and Bengio, Y. (1994) · 1994

Earlier work this paper cites.

Efficient and effective clustering methods for spatial data mining

Ng, R. T. and Han, J. (1994) · 1994

Earlier work this paper cites.

Birch: A new data clustering algorithm and its applications

Original

Zhang, T., Ramakrishnan, R., and Livny, M. (1997) · 1997

Earlier work this paper cites.

Refining initial points for k-means clustering

Bradley, P. S. and Fayyad, U. M. (1998) · 1998

Earlier work this paper cites.

Using the triangle inequality to accelerate k-means

Elkan, C. (2003) · 2003

Earlier work this paper cites.

Numerical Optimization

Nocedal, J. and Wright, S. J. (2006) · 2006

Earlier work this paper cites.

k-means++: The advantages of careful seeding

Arthur, D. and Vassilvitskii, S. (2007) · 2007

Earlier work this paper cites.

NP-hardness of Euclidean sum-of-squares clustering

Aloise, D., Deshpande, A., Hansen, P., and Popat, P. (2009) · 2009

Earlier work this paper cites.

Two classes of multisecant methods for nonlinear acceleration

Fang, H.-r. and Saad, Y. (2009) · 2009

Earlier work this paper cites.

Making k-means even faster

Hamerly, G. (2010) · 2010

Cited alongside, same era.

Anderson acceleration for fixed-point iterations

Walker, H. F. and Ni, P. (2011) · 2011

Cited alongside, same era.

Anderson acceleration for nonlinear finite volume scheme for advection-diffusion problems

Lipnikov, K., Svyatskiy, D., and Vassilevski, Y. (2013) · 2013

Cited alongside, same era.

A characterization of the behavior of the anderson acceleration on linear problems

Potra, F. A. and Engler, H. (2013) · 2013

Cited alongside, same era.

Yinyang k-means: A drop-in replacement of the classic k-means with consistent speedup

Ding, Y., Zhao, Y., Shen, X., Musuvathi, M., and Mytkowicz, T. (2015) · 2015

Cited alongside, same era.

Accelerating lloyd’s algorithm for k-means clustering

Hamerly, G. and Drake, J. (2015) · 2015

Cited alongside, same era.

MM Optimization Algorithms

Lange, K. (2016) · 2016

Later among the works it cites.

Fast k-means with accurate bounds

Newling, J. and Fleuret, F. (2016) · 2016

Later among the works it cites.

Anderson acceleration of the jacobi iterative method: An efficient alternative to Krylov methods for large, sparse linear systems

Pratapa, P. P., Suryanarayana, P., and Pask, J. E. (2016) · 2016

Later among the works it cites.

Anderson acceleration and application to the three-temperature energy equations

An, H., Jia, X., and Walker, H. F. (2017) · 2017

Later among the works it cites.

UCI machine learning repository

Dheeru, D. and Karra Taniskidou, E. (2017) · 2017

Later among the works it cites.

Accelerating the Uzawa algorithm

Ho, N., Olson, S. D., and Walker, H. F. (2017) · 2017

Later among the works it cites.