Fetching the paper…
Reading the bibliography…
Spectral clustering is a powerful unsupervised machine learning algorithm for clustering data with non convex or nested structures.
Z. Bai, J. Demmel, J. Dongarra, A. Ruhe, and H. van der Vorst, Templates for the solution of algebraic eigenvalue problems: a practical guide . SIAM, 2000
2000
Earlier work this paper cites.
A. Y. Ng, M. I. Jordan, and Y. Weiss, “On spectral clustering: Analysis and an algorithm,” in Advances in neural information processing systems , 2002, pp. 849–856
2002
Earlier work this paper cites.
M. A. Nielsen and I. Chuang, “Quantum computation and quantum information,” 2002
2002
Earlier work this paper cites.
G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, “Quantum amplitude amplification and estimation,” Contemporary Mathematics , vol. 305, pp. 53–74, 2002
2002
Earlier work this paper cites.
P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay, “Clustering large graphs via the singular value decomposition,” Machine learning , vol. 56, no. 1-3, pp. 9–33, 2004
2004
Earlier work this paper cites.
A. Rahimi and B. Recht, “Random features for large-scale kernel machines,” in Advances in neural information processing systems , 2008, pp. 1177–1184
2008
Earlier work this paper cites.
D. Yan, L. Huang, and M. I. Jordan, “Fast approximate spectral clustering,” in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining , 2009, pp. 907–916
2009
Earlier work this paper cites.
M. Li, X.-C. Lian, J. T. Kwok, and B.-L. Lu, “Time and space efficient spectral clustering via column sampling,” in CVPR 2011 . IEEE, 2011, pp. 2297–2304
2011
Earlier work this paper cites.
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,” Journal of Machine Learning Research , vol. 12, pp. 2825–2830, 2011
2011
Earlier work this paper cites.
E. Aïmeur, G. Brassard, and S. Gambs, “Quantum speed-up for unsupervised learning,” Machine Learning , vol. 90, no. 2, pp. 261–287, 2013
2013
Earlier work this paper cites.
A. Choromanska, T. Jebara, H. Kim, M. Mohan, and C. Monteleoni, “Fast spectral clustering via the nyström method,” in International Conference on Algorithmic Learning Theory . Springer, 2013, pp. 367–381
2013
Cited alongside, same era.
S. Lloyd, M. Mohseni, and P. Rebentrost, “Quantum principal component analysis,” Nature Physics , vol. 10, no. 9, p. 631, 2014
2014
Cited alongside, same era.
N. Wiebe, A. Kapoor, and K. M. Svore, “Quantum deep learning,” arXiv preprint arXiv:1412.3489 , 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
2017
Later among the works it cites.
A. Daskin, “Quantum spectral clustering through a biased phase estimation algorithm,” 2017
2017
Later among the works it cites.
2018
Later among the works it cites.
I. Kerenidis, J. Landman, A. Luongo, and A. Prakash, “q-means: A quantum algorithm for unsupervised machine learning,” in Advances in Neural Information Processing Systems , 2019, pp. 4136–4146
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
G. Hamerly and J. Drake, “Accelerating lloyd’s algorithm for k-means clustering,” in Partitional clustering algorithms . Springer, 2015, pp. 41–78
2015
Cited alongside, same era.
S. X. Cui, M. H. Freedman, O. Sattath, R. Stong, and G. Minton, “Quantum max-flow/min-cut,” Journal of Mathematical Physics , vol. 57, no. 6, p. 062206, Jun 2016
2016
Cited alongside, same era.
I. Kerenidis and A. Prakash, “Quantum recommendation systems,” Proceedings of the 8th Innovations in Theoretical Computer Science Conference , 2017
2017
Cited alongside, same era.
A. M. Childs, R. Kothari, and R. D. Somma, “Quantum algorithm for systems of linear equations with exponentially improved dependence on precision,” SIAM Journal on Computing , vol. 46, no. 6, pp. 1920–1950, 2017
2017
Cited alongside, same era.
D. J. Moylett, N. Linden, and A. Montanaro, “Quantum speedup of the traveling-salesman problem for bounded-degree graphs,” Physical Review A , vol. 95, no. 3, p. 032323, 2017
2017
Cited alongside, same era.
F. Arute, K. Arya, R. Babbush, D. Bacon, J. C. Bardin, R. Barends, R. Biswas, S. Boixo, F. G. Brandao, D. A. Buell et al. , “Quantum supremacy using a programmable superconducting processor,” Nature , vol. 574, no. 7779, pp. 505–510, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
S. Wang, A. Gittens, and M. W. Mahoney, “Scalable kernel k-means clustering with nyström approximation: relative-error bounds,” The Journal of Machine Learning Research , vol. 20, no. 1, pp. 431–479, 2019
2019
Later among the works it cites.
I. Kerenidis, J. Landman, and A. Prakash, “Quantum algorithms for deep convolutional neural networks,” in Proceedings of the International Conference on Learning Representations (ICLR) , 2020
2020
Closest in time.
N. Tremblay and A. Loukas, “Approximating spectral clustering via sampling: a review,” in Sampling Techniques for Supervised or Unsupervised Tasks . Springer, 2020, pp. 129–183
2020
Closest in time.
I. Kerenidis and A. Prakash, “Quantum gradient descent for linear systems and least squares,” Physical Review A , vol. 101, no. 2, p. 022316, 2020
2020
Closest in time.