{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T01:44:53Z","timestamp":1569894293329},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1007\/s10994-012-5316-5","type":"journal-article","created":{"date-parts":[[2012,8,30]],"date-time":"2012-08-30T19:39:33Z","timestamp":1346355573000},"page":"261-287","source":"Crossref","is-referenced-by-count":47,"title":["Quantum speed-up for unsupervised learning"],"prefix":"10.1007","volume":"90","author":[{"given":"Esma","family":"A\u00efmeur","sequence":"first","affiliation":[]},{"given":"Gilles","family":"Brassard","sequence":"additional","affiliation":[]},{"given":"S\u00e9bastien","family":"Gambs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,31]]},"reference":[{"key":"5316_CR1","author":"D. Aharonov","first-page":"42","year":"2004","unstructured":"Aharonov, D., van Dam, W., Kempe, J., Landau, J., Lloyd, S., & Regev, O. (2004). Adiabatic quantum computation is equivalent to standard quantum computation. In Proceedings of 45th IEEE symposium on foundations of computer science (pp. 42\u201351).","volume-title":"Proceedings of 45th IEEE symposium on foundations of computer science","DOI":"10.1109\/FOCS.2004.8","doi-asserted-by":"crossref"},{"key":"5316_CR2","author":"E. A\u00efmeur","first-page":"433","year":"2006","unstructured":"A\u00efmeur, E., Brassard, G., & Gambs, S. (2006). Machine learning in a quantum world. In Proceedings of the 19th Canadian conference on artificial intelligence (pp. 433\u2013444).","volume-title":"Proceedings of the 19th Canadian conference on artificial intelligence"},{"key":"5316_CR3","author":"E. A\u00efmeur","first-page":"1","year":"2007","unstructured":"A\u00efmeur, E., Brassard, G., & Gambs, S. (2007). Quantum clustering algorithms. In Proceedings of the 24th international conference on machine learning (pp. 1\u20138).","volume-title":"Proceedings of the 24th international conference on machine learning"},{"issue":"4","key":"5316_CR4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1142\/S0219749903000383","volume":"1","author":"A. Ambainis","year":"2003","unstructured":"Ambainis, A. (2003). Quantum walks and their algorithmic applications. International Journal of Quantum Information, 1(4), 507\u2013518.","journal-title":"International Journal of Quantum Information"},{"key":"5316_CR5","author":"F. Angiulli","first-page":"15","year":"2002","unstructured":"Angiulli, F., & Pizzuti, C. (2002). Fast outlier detection in high dimensional spaces. In Proceedings of the 6th European conference on principles and practice of knowledge discovery in databases (pp. 15\u201326).","volume-title":"Proceedings of the 6th European conference on principles and practice of knowledge discovery in databases"},{"key":"5316_CR6","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319\u2013342.","journal-title":"Machine Learning"},{"issue":"1","key":"5316_CR7","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/S0893-6080(03)00087-X","volume":"16","author":"D. Anguita","year":"2003","unstructured":"Anguita, D., Ridella, S., Riviecco, F., & Zunino, R. (2003). Quantum optimization for training support vector machines. Neural Networks, 16(1), 763\u2013770.","journal-title":"Neural Networks"},{"key":"5316_CR8","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"C. H. Bennett","year":"1973","unstructured":"Bennett, C. H. (1973). Logical reversibility of computation. IBM Journal of Research and Development, 17, 525\u2013532.","journal-title":"IBM Journal of Research and Development"},{"key":"5316_CR9","doi-asserted-by":"crossref","first-page":"2881","DOI":"10.1103\/PhysRevLett.69.2881","volume":"69","author":"C. H. Bennett","year":"1992","unstructured":"Bennett, C. H., & Wiesner, S. J. (1992). Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physical Review Letters, 69, 2881\u20132884.","journal-title":"Physical Review Letters"},{"issue":"5","key":"5316_CR10","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C. H. Bennett","year":"1997","unstructured":"Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997). Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5), 1510\u20131523.","journal-title":"SIAM Journal on Computing"},{"issue":"9","key":"5316_CR11","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J. L. Bentley","year":"1975","unstructured":"Bentley, J. L. (1975). Multidimensional binary search tree used for associative searching. Communications of the ACM, 18(9), 509\u2013517.","journal-title":"Communications of the ACM"},{"key":"5316_CR12","author":"S. N. Bespamyatnikh","first-page":"137","year":"1998","unstructured":"Bespamyatnikh, S. N. (1998). An efficient algorithm for the three-dimensional diameter problem. In Proceedings of the 9th symposium on discrete algorithms (pp. 137\u2013146).","volume-title":"Proceedings of the 9th symposium on discrete algorithms"},{"key":"5316_CR13","first-page":"37","volume":"3","author":"O. Bor\u016fvka","year":"1926","unstructured":"Bor\u016fvka, O. (1926). O jist\u00e9m probl\u00e9mu minim\u00e1ln\u00edm. Pr\u00e1ce Moravsk\u00e9 P\u0159\u00edrodov\u011bdeck\u00e9 Spole\u010dnosti, 3, 37\u201358.","journal-title":"Pr\u00e1ce Moravsk\u00e9 P\u0159\u00edrodov\u011bdeck\u00e9 Spole\u010dnosti"},{"key":"5316_CR14","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M. Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., & Tapp, A. (1998). Tight bounds on quantum searching. Fortschritte der Physik, 46, 493\u2013505.","journal-title":"Fortschritte der Physik"},{"issue":"11","key":"5316_CR15","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1023\/A:1026009100467","volume":"33","author":"G. Brassard","year":"2003","unstructured":"Brassard, G. (2003). Quantum communication complexity. Foundations of Physics, 33(11), 1593\u20131616.","journal-title":"Foundations of Physics"},{"key":"5316_CR16","author":"G. Brassard","first-page":"12","year":"1997","unstructured":"Brassard, G., & H\u00f8yer, P. (1997). An exact quantum polynomial-time algorithm for Simon\u2019s problem. In Proceedings of the 5th Israel symposium on theory of computing and systems (pp. 12\u201323).","volume-title":"Proceedings of the 5th Israel symposium on theory of computing and systems","DOI":"10.1109\/ISTCS.1997.595153","doi-asserted-by":"crossref"},{"key":"5316_CR17","author":"G. Brassard","first-page":"820","year":"1998","unstructured":"Brassard, G., H\u00f8yer, P., & Tapp, A. (1998). Quantum counting. In Proceedings of the 25th international conference on automata, languages and programming (pp. 820\u2013831).","volume-title":"Proceedings of the 25th international conference on automata, languages and programming","DOI":"10.1007\/BFb0055105","doi-asserted-by":"crossref"},{"key":"5316_CR18","author":"G. Brassard","first-page":"53","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., & Tapp, A. (2002). Quantum amplitude amplification and estimation. In S. J. Lomonaco Jr. (Ed.), Quantum computation and quantum information (pp. 53\u201374).","volume-title":"Quantum computation and quantum information","DOI":"10.1090\/conm\/305\/05215","doi-asserted-by":"crossref"},{"key":"5316_CR19","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1007\/s10701-005-7353-4","volume":"35","author":"G. Brassard","year":"2005","unstructured":"Brassard, G., Broadbent, A., & Tapp, A. (2005). Quantum pseudo-telepathy. Foundations of Physics, 35, 1877\u20131907.","journal-title":"Foundations of Physics"},{"key":"5316_CR20","unstructured":"Brassard, G., Dupuis, F., Gambs, S., & Tapp, A. (2011). An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance. arXiv:1106.4267 ."},{"key":"5316_CR21","author":"M. M. Breunig","first-page":"93","year":"2000","unstructured":"Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000). LOF: identifying density-based local outliers. In Proceedings of the 2000 ACM SIGMOD international conference on management of data (pp. 93\u2013104).","volume-title":"Proceedings of the 2000 ACM SIGMOD international conference on management of data","DOI":"10.1145\/342009.335388","doi-asserted-by":"crossref"},{"issue":"26","key":"5316_CR22","doi-asserted-by":"crossref","first-page":"2489","DOI":"10.1016\/j.tcs.2008.12.046","volume":"410","author":"A. Broadbent","year":"2009","unstructured":"Broadbent, A., & Kashefi, E. (2009). Parallelizing quantum circuits. Theoretical Computer Science, 410(26), 2489\u20132510.","journal-title":"Theoretical Computer Science"},{"key":"5316_CR23","unstructured":"Buhrman, H., Cleve, R., Massar, S., & de Wolf, R. (2009). Non-locality and communication complexity. arXiv:0907.3584 ."},{"key":"5316_CR24","author":"R. Cleve","first-page":"61","year":"1999","unstructured":"Cleve, R., van Dam, W., Nielsen, M., & Tapp, A. (1999). Quantum entanglement and the communication complexity of the inner product function. In Proceedings of the first NASA international conference on quantum computing and quantum communications (pp. 61\u201374).","volume-title":"Proceedings of the first NASA international conference on quantum computing and quantum communications","DOI":"10.1007\/3-540-49208-9_4","doi-asserted-by":"crossref"},{"key":"5316_CR25","author":"T. Cox","year":"1994","unstructured":"Cox, T., & Cox, M. (1994). Multidimensional scaling. London: Chapman and Hall.","volume-title":"Multidimensional scaling"},{"issue":"4","key":"5316_CR26","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.jcss.2004.10.006","volume":"70","author":"S. Dasgupta","year":"2005","unstructured":"Dasgupta, S., & Long, P. M. (2005). Performance guarantee for hierarchical clustering. Journal of Computer and System Sciences, 70(4), 555\u2013569.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"5316_CR27","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0304-3975(02)00377-8","volume":"287","author":"R. Wolf de","year":"2002","unstructured":"de Wolf, R. (2002). Quantum communication and complexity. Theoretical Computer Science, 287(1), 337\u2013353.","journal-title":"Theoretical Computer Science"},{"key":"5316_CR28","author":"D. Dong","first-page":"686","year":"2005","unstructured":"Dong, D., Chen, C., & Chen, Z. (2005). Quantum reinforcement learning. In Proceedings of the first international conference on advances in natural computation (pp. 686\u2013689).","volume-title":"Proceedings of the first international conference on advances in natural computation","DOI":"10.1007\/11539117_97","doi-asserted-by":"crossref"},{"key":"5316_CR29","unstructured":"D\u00fcrr, C., & H\u00f8yer, P. (1996). A quantum algorithm for finding the minimum. arXiv:quant-ph\/9607014 ."},{"key":"5316_CR30","author":"C. D\u00fcrr","first-page":"481","year":"2004","unstructured":"D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., & Mhalla, M. (2004). Quantum query complexity of some graph problems. In Proceedings of the 31st international conference on automata, languages and programming (pp. 481\u2013493).","volume-title":"Proceedings of the 31st international conference on automata, languages and programming","DOI":"10.1007\/978-3-540-27836-8_42","doi-asserted-by":"crossref"},{"key":"5316_CR31","author":"A. A. Ezhov","year":"2003","unstructured":"Ezhov, A. A., & Berman, G. P. (2003). Introduction to quantum neural technologies. Princeton: Rinton Press.","volume-title":"Introduction to quantum neural technologies"},{"key":"5316_CR32","unstructured":"Farhi, E., Goldsone, J., Gutmann, S., & Sipser, M. (2000). Quantum computation by adiabatic evolution. arXiv:quant-ph\/0001106 ."},{"issue":"2","key":"5316_CR33","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0304-3975(01)00258-4","volume":"287","author":"D. V. Finocchiaro","year":"2002","unstructured":"Finocchiaro, D. V., & Pellegrini, M. (2002). On computing the diameter of a point set in high dimensional Euclidean space. Theoretical Computer Science, 287(2), 501\u2013514.","journal-title":"Theoretical Computer Science"},{"key":"5316_CR34","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman.","volume-title":"Computers and intractability: a guide to the theory of NP-completeness"},{"issue":"5","key":"5316_CR35","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevA.78.052310","volume":"78","author":"V. Giovannetti","year":"2008","unstructured":"Giovannetti, V., Lloyd, S., & Maccone, L. (2008). Architectures for a quantum random access memory. Physical Review A, 78(5), 052310.","journal-title":"Physical Review A"},{"key":"5316_CR36","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. F. Gonz\u00e1lez","year":"1985","unstructured":"Gonz\u00e1lez, T. F. (1985). Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38, 293\u2013306.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"5316_CR37","doi-asserted-by":"crossref","first-page":"54","DOI":"10.2307\/2346439","volume":"18","author":"J. C. Gower","year":"1969","unstructured":"Gower, J. C., & Ross, G. J. S. (1969). Minimum spanning trees and single linkage cluster analysis. Applied Statistics, 18(1), 54\u201364.","journal-title":"Applied Statistics"},{"issue":"2","key":"5316_CR38","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L. K. Grover","year":"1997","unstructured":"Grover, L. K. (1997). Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 79(2), 325\u2013328.","journal-title":"Physical Review Letters"},{"key":"5316_CR39","author":"L. K. Grover","first-page":"53","year":"1998","unstructured":"Grover, L. K. (1998). A framework for fast quantum mechanical algorithms. In Proceedings of the 30th ACM symposium on theory of computing (pp. 53\u201362).","volume-title":"Proceedings of the 30th ACM symposium on theory of computing"},{"key":"5316_CR40","author":"D. Harel","first-page":"18","year":"2001","unstructured":"Harel, D., & Koren, Y. (2001). On clustering using random walks. In Proceedings of the 21st conference on foundations of software technology and theoretical computer science (pp. 18\u201341).","volume-title":"Proceedings of the 21st conference on foundations of software technology and theoretical computer science"},{"key":"5316_CR41","first-page":"177","volume":"9","author":"A. S. Holevo","year":"1973","unstructured":"Holevo, A. S. (1973). Bounds for the quantity of information transmitted by a quantum mechanical channel. Problems of Information Transmission, 9, 177\u2013183.","journal-title":"Problems of Information Transmission"},{"key":"5316_CR42","author":"D. Horn","first-page":"769","year":"2001","unstructured":"Horn, D., & Gottlieb, A. (2001). The method of quantum clustering. In Proceedings of the neural information processing systems (pp. 769\u2013776).","volume-title":"Proceedings of the neural information processing systems"},{"issue":"1","key":"5316_CR43","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevLett.88.018702","volume":"88","author":"D. Horn","year":"2002","unstructured":"Horn, D., & Gottlieb, A. (2002). Algorithms for data clustering in pattern recognition problems based on quantum mechanics. Physical Review Letters, 88(1), 018702.","journal-title":"Physical Review Letters"},{"key":"5316_CR44","author":"L. Kaufman","first-page":"405","year":"1987","unstructured":"Kaufman, L., & Rousseeuw, P. (1987). Clustering by means of medoids. In Y. Dodge (Ed.), Statistical data analysis based on the L 1 -norm and related methods (pp. 405\u2013416).","volume-title":"Statistical data analysis based on the L 1-norm and related methods"},{"issue":"4","key":"5316_CR45","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1080\/00107151031000110776","volume":"44","author":"J. Kempe","year":"2003","unstructured":"Kempe, J. (2003). Quantum random walks\u2014An introductory overview. Contemporary Physics, 44(4), 307\u2013327.","journal-title":"Contemporary Physics"},{"key":"5316_CR46","author":"A. M. Kibriya","first-page":"140","year":"2007","unstructured":"Kibriya, A. M., & Frank, E. (2007). An empirical comparison of exact nearest neighbour algorithms. In Proceedings of the 11th European conference on principles and practice of knowledge discovery in databases (pp. 140\u2013151).","volume-title":"Proceedings of the 11th European conference on principles and practice of knowledge discovery in databases"},{"key":"5316_CR47","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., & Nisan, N. (1997). Communication complexity. Cambridge: Cambridge University Press.","volume-title":"Communication complexity","DOI":"10.1016\/S0065-2458(08)60342-3","doi-asserted-by":"crossref"},{"key":"5316_CR48","author":"Q. Li","volume":"42","year":"2009","unstructured":"Li, Q., He, Y., & Jiang, J.-p. (2009). A novel clustering algorithm based on quantum games. Journal of Physics A: Mathematical and Theoretical, 42, 445303.","journal-title":"Journal of Physics A: Mathematical and Theoretical"},{"issue":"1","key":"5316_CR49","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s11128-010-0169-y","volume":"10","author":"Q. Li","year":"2011","unstructured":"Li, Q., He, Y., & Jiang, J.-p. (2011). A hybrid classical-quantum clustering algorithm based on quantum walks. Quantum Information Processing, 10(1), 13\u201326.","journal-title":"Quantum Information Processing"},{"issue":"2","key":"5316_CR50","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S. P. Lloyd","year":"1982","unstructured":"Lloyd, S. P. (1982). Least square quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129\u2013137. First made available as a\u00a0Bell Telephone Laboratories Paper (1957).","journal-title":"IEEE Transactions on Information Theory"},{"key":"5316_CR51","author":"F. Magniez","first-page":"575","year":"2007","unstructured":"Magniez, F., Nayak, A., Roland, J., & S\u00e1ntha, M. (2007). Search via quantum walk. In Proceedings of the 39th ACM symposium on theory of computing (pp. 575\u2013584).","volume-title":"Proceedings of the 39th ACM symposium on theory of computing"},{"key":"5316_CR52","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0003-2670(00)82910-4","volume":"187","author":"D. L. Massart","year":"1986","unstructured":"Massart, D. L., Kaufman, L., & Rousseeuw, P. J. (1986). Least median of squares: a robust method for outlier and model error detection in regression and calibration. Analytica Chimica Acta, 187, 171\u2013179.","journal-title":"Analytica Chimica Acta"},{"key":"5316_CR53","author":"N. Mishra","first-page":"439","year":"2001","unstructured":"Mishra, N., Oblinger, D., & Pitt, L. (2001). Sublinear time approximate clustering. In Proceedings of the 12th symposium on discrete algorithms (pp. 439\u2013447).","volume-title":"Proceedings of the 12th symposium on discrete algorithms"},{"key":"5316_CR54","author":"A. Nayak","first-page":"384","year":"1999","unstructured":"Nayak, A., & Wu, F. (1999). The quantum query complexity of approximating the median and related statistics. In Proceedings of the 31st ACM symposium on theory of computing (pp. 384\u2013393).","volume-title":"Proceedings of the 31st ACM symposium on theory of computing"},{"key":"5316_CR55","author":"M. A. Nielsen","year":"2000","unstructured":"Nielsen, M. A., & Chuang, I. L. (2000). Quantum computation and quantum information. Cambridge: Cambridge University Press.","volume-title":"Quantum computation and quantum information"},{"issue":"3","key":"5316_CR56","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1137\/0210040","volume":"10","author":"C. H. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C. H. (1981). Worst-case and probabilistic analysis of a geometric location problem. SIAM Journal on Computing, 10(3), 542\u2013557.","journal-title":"SIAM Journal on Computing"},{"key":"5316_CR57","author":"F. P. Preparata","year":"1985","unstructured":"Preparata, F. P., & Shamos, M. I. (1985). Computational geometry: an introduction. New York: Springer.","volume-title":"Computational geometry: an introduction","DOI":"10.1007\/978-1-4612-1098-6","doi-asserted-by":"crossref"},{"issue":"6","key":"5316_CR58","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R. C. Prim","year":"1957","unstructured":"Prim, R. C. (1957). Shortest connecting networks and some generalizations. The Bell System Technical Journal, 36(6), 1389\u20131401.","journal-title":"The Bell System Technical Journal"},{"issue":"22","key":"5316_CR59","doi-asserted-by":"crossref","first-page":"5188","DOI":"10.1103\/PhysRevLett.86.5188","volume":"88","author":"R. Raussendorf","year":"2001","unstructured":"Raussendorf, R., & Briegel, H. J. (2001). A one-way quantum computer. Physical Review Letters, 88(22), 5188\u20135191.","journal-title":"Physical Review Letters"},{"key":"5316_CR60","author":"M. S\u00e1ntha","first-page":"31","year":"2008","unstructured":"S\u00e1ntha, M. (2008). Quantum walk based search algorithms. In Proceedings of 5th international conference on theory and applications of models of computation (pp. 31\u201346).","volume-title":"Proceedings of 5th international conference on theory and applications of models of computation","DOI":"10.1007\/978-3-540-79228-4_3","doi-asserted-by":"crossref"},{"key":"5316_CR61","author":"R. Servedio","first-page":"1065","year":"2001","unstructured":"Servedio, R. (2001). Separating quantum and classical learning. In Proceedings of the 28th international conference on automata, languages and programming (pp. 1065\u20131080).","volume-title":"Proceedings of the 28th international conference on automata, languages and programming","DOI":"10.1007\/3-540-48224-5_86","doi-asserted-by":"crossref"},{"issue":"5","key":"5316_CR62","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. W. Shor","year":"1997","unstructured":"Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484\u20131509.","journal-title":"SIAM Journal on Computing"},{"key":"5316_CR63","author":"M. Szegedy","first-page":"32","year":"2004","unstructured":"Szegedy, M. (2004). Quantum speed-up of Markov chain based algorithms. In Proceedings of 45th IEEE symposium on foundations of computer science (pp. 32\u201341).","volume-title":"Proceedings of 45th IEEE symposium on foundations of computer science","DOI":"10.1109\/FOCS.2004.53","doi-asserted-by":"crossref"},{"issue":"5500","key":"5316_CR64","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"J. B. Tenenbaum","year":"2000","unstructured":"Tenenbaum, J. B., de Silva, V., & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2319\u20132323.","journal-title":"Science"},{"key":"5316_CR65","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"5316_CR66","author":"I. H. Witten","year":"2005","edition":"2","unstructured":"Witten, I. H., & Frank, E. (2005). Data mining: practical machine learning tools and techniques (2nd ed.). San Mateo: Morgan Kaufmann.","volume-title":"Data mining: practical machine learning tools and techniques"},{"issue":"3","key":"5316_CR67","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1023\/B:DAMI.0000023676.72185.7c","volume":"8","author":"K. Yamanishi","year":"2004","unstructured":"Yamanishi, K., Takeuchi, J., Williams, G. J., & Milne, P. (2004). On-line unsupervised outlier detection using finite mixtures with discounting learning algorithms. Data Mining and Knowledge Discovery, 8(3), 275\u2013300.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"9","key":"5316_CR68","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1007\/s00500-009-0478-1","volume":"14","author":"Y. Yu","year":"2010","unstructured":"Yu, Y., Qian, F., & Liu, H. (2010). Quantum clustering-based weighted linear programming support vector regression for multivariable nonlinear problem. Soft Computing, 14(9), 921\u2013929.","journal-title":"Soft Computing"},{"issue":"1","key":"5316_CR69","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"20","author":"C. T. Zahn","year":"1971","unstructured":"Zahn, C. T. (1971). Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers, 20(1), 68\u201386.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10994-012-5316-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T07:28:32Z","timestamp":1562138912000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,31]]},"references-count":69,"journal-issue":{"published-print":{"date-parts":[[2013,2]]},"issue":"2"},"alternative-id":["5316"],"URL":"http:\/\/dx.doi.org\/10.1007\/s10994-012-5316-5","relation":{"cites":[]},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":["Software","Artificial Intelligence"]}}