Balanced k-Means Clustering on an Adiabatic Quantum Computer

M. E. Celebi, H. A. Kingravi, and P. A. Vela, “A comparative study of efficient initialization methods for the k-means clustering algorithm,” CoRR , vol. abs/1209.1960, 2012. [Online]. Available: http://arxiv.org/abs/1209.1960

Original

1960

Earlier work this paper cites.

L. Hyafil and R. L. Rivest, “Constructing optimal binary decision trees is np-complete,” Inf. Process. Lett. , vol. 5, pp. 15–17, 1976

1976

Earlier work this paper cites.

J. A. Hartigan and M. A. Wong, “Algorithm AS 136: A K-Means clustering algorithm,” Applied Statistics , vol. 28, no. 1, pp. 100–108, 1979. [Online]. Available: http://dx.doi.org/10.2307/2346830

1979

Earlier work this paper cites.

A. Blum and R. L. Rivest, “Training a 3-node neural network is np-complete,” in Proceedings of the First Annual Workshop on Computational Learning Theory , ser. COLT ’88. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1988, p. 9–18

1988

Earlier work this paper cites.

M. Inaba, N. Katoh, and H. Imai, “Applications of weighted voronoi diagrams and randomization to variance-based k-clustering: (extended abstract),” in Proceedings of the Tenth Annual Symposium on Computational Geometry , ser. SCG ’94. New York, NY, USA: Association for Computing Machinery, 1994, p. 332–339. [Online]. Available: https://doi.org/10.1145/177424.178042

1994

Earlier work this paper cites.

P. S. Bradley, K. P. Bennett, and A. Demiriz, “Constrained k-means clustering,” Microsoft Research, Redmond , vol. 20, no. 0, p. 0, 2000

2000

Earlier work this paper cites.

G. Gupta and M. Younis, “Load-balanced clustering of wireless sensor networks,” in IEEE International Conference on Communications, 2003. ICC ’03. , vol. 3, 2003, pp. 1848–1852 vol.3

2003

Earlier work this paper cites.

A. Banerjee and J. Ghosh, “Competitive learning mechanisms for scalable, incremental and balanced clustering of streaming texts,” in Proceedings of the International Joint Conference on Neural Networks, 2003. , vol. 4, 2003, pp. 2697–2702 vol.4

2003

Earlier work this paper cites.

J. Ghosh and A. Strehl, Clustering and Visualization of Retail Market Baskets . London: Springer London, 2005, pp. 75–102

2005

Earlier work this paper cites.

D. Arthur and S. Vassilvitskii, “How slow is the k-means method?” in Proceedings of the Twenty-Second Annual Symposium on Computational Geometry , ser. SCG ’06. New York, NY, USA: Association for Computing Machinery, 2006, p. 144–153. [Online]. Available: https://doi.org/10.1145/1137856.1137880

2006

Earlier work this paper cites.

D. Aloise, A. Deshpande, P. Hansen, and P. Popat, “Np-hardness of euclidean sum-of-squares clustering,” Machine Learning , vol. 75, pp. 245–248, 05 2009

2009

Earlier work this paper cites.

S. Na, L. Xumin, and G. Yong, “Research on k-means clustering algorithm: An improved k-means clustering algorithm,” in 2010 Third International Symposium on Intelligent Information Technology and Security Informatics , 2010, pp. 63–67

2010

Cited alongside, same era.

F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay, “Scikit-learn: Machine learning in python,” J. Mach. Learn. Res. , vol. 12, no. null, p. 2825–2830, Nov. 2011

2011

Cited alongside, same era.

N. Ganganath, C. Cheng, and C. K. Tse, “Data clustering with cluster size constraints using a modified k-means algorithm,” in 2014 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery , 2014, pp. 158–161

2014

Cited alongside, same era.

M. I. Malinen and P. Fränti, “Balanced k-means for clustering,” in Structural, Syntactic, and Statistical Pattern Recognition , P. Fränti, G. Brown, M. Loog, F. Escolano, and M. Pelillo, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014, pp. 32–41

C. Bauckhage, C. Ojeda, R. Sifa, and S. Wrobel, “Adiabatic quantum computing for kernel k=2 means clustering,” in LWDA , 2018

2018

Later among the works it cites.

V. Kumar, G. Bass, C. Tomlin, and J. Dulny, “Quantum annealing for combinatorial clustering,” Quantum Information Processing , vol. 17, pp. 1–14, 2018

2018

Later among the works it cites.

P. Date, C. Schuman, R. Patton, and T. Potok, “A classical-quantum hybrid approach for unsupervised probabilistic machine learning,” in Future of Information and Communication Conference . Springer, 2019, pp. 98–117

2019

Later among the works it cites.

S. U. Khan, A. J. Awan, and G. Vall-Llosera, “K-means clustering on noisy intermediate scale quantum computers,” 2019

2019

Later among the works it cites.

C. Bauckhage, N. Piatkowski, R. Sifa, D. Hecker, and S. Wrobel, “A qubo formulation of the k-medoids problem.” in LWDA , 2019, pp. 54–63