{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:19Z","timestamp":1759638439098,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031059353"},{"type":"electronic","value":"9783031059360"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-05936-0_8","type":"book-chapter","created":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T16:07:09Z","timestamp":1652198829000},"page":"96-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Effect of\u00a0Different Encodings and\u00a0Distance Functions on\u00a0Quantum Instance-Based Classifiers"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Berti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Bernasconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianna M.","family":"Del Corso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Guidotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,11]]},"reference":[{"key":"8_CR1","unstructured":"Afham, A., et al.: Quantum K-nearest neighbor machine learning algorithm. arXiv:2003.09187 (2020)"},{"key":"8_CR2","first-page":"53","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., et al.: Quantum amplitude amplification and estimation. Quantum Comput. Inf. 305, 53\u201374 (2002)","journal-title":"Quantum Comput. Inf."},{"issue":"9","key":"8_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11128-018-2004-9","volume":"17","author":"Y Dang","year":"2018","unstructured":"Dang, Y., Jiang, N., Hu, H., Ji, Z., Zhang, W.: Image classification based on quantum K-nearest-neighbor algorithm. Quantum Inf. Proc. 17(9), 239 (2018). https:\/\/doi.org\/10.1007\/s11128-018-2004-9","journal-title":"Quantum Inf. Proc."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Dougherty, J., Kohavi, R., Sahami, M.: Supervised and unsupervised discretization of continuous features. In: ICML, pp. 194\u2013202 (1995)","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"key":"8_CR5","unstructured":"Durr, C., Hoyer, P.: A quantum algorithm for finding the minimum. arXiv preprint arXiv:quant-ph\/9607014v2 (1999)"},{"key":"8_CR6","unstructured":"Kaye, P.: Reversible addition circuit using one ancillary bit with application to quantum computing. arXiv, p. 0408173, August 2004"},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924801","volume-title":"Mining of Massive Datasets","author":"J Leskovec","year":"2014","unstructured":"Leskovec, J., et al.: Mining of Massive Datasets. Cambridge University Press, Cambridge (2014)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Li, J., Lin, S., Kai, Y., Guo, G.: Quantum K-nearest neighbor classification algorithm based on hamming distance. arXiv preprint arXiv:2103.04253 (2021)","DOI":"10.1007\/s11128-021-03361-0"},{"key":"8_CR9","unstructured":"Lloyd, S., Mohseni, M., Rebentrost, P.: Quantum algorithms for supervised and unsupervised machine learning. arXiv preprint arXiv:1307.0411 (2013)"},{"key":"8_CR10","first-page":"467","volume":"5","author":"M M\u00f6tt\u00f6nen","year":"2005","unstructured":"M\u00f6tt\u00f6nen, M., et al.: Transformation of quantum states using uniformly controlled rotations. Quantum Inf. Com. 5, 467\u2013473 (2005)","journal-title":"Quantum Inf. Com."},{"key":"8_CR11","unstructured":"Nielsen, M., et al.: Quantum Computation and Quantum Information. CUP, Cambridge (2016)"},{"issue":"1","key":"8_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-018-37186-2","volume":"9","author":"DK Park","year":"2019","unstructured":"Park, D.K., Petruccione, F., Rhee, J.-K.K.: Circuit-based quantum random access memory for classical data. Sci. Rep. 9(1), 1\u20138 (2019)","journal-title":"Sci. Rep."},{"issue":"11","key":"8_CR13","first-page":"3496","volume":"56","author":"Y Ruan","year":"2017","unstructured":"Ruan, Y., et al.: Quantum algorithm for K-nearest neighbors classification based on the metric of hamming distance. IJTP 56(11), 3496\u20133507 (2017)","journal-title":"IJTP"},{"issue":"6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"60002","DOI":"10.1209\/0295-5075\/119\/60002","volume":"119","author":"M Schuld","year":"2017","unstructured":"Schuld, M., et al.: Implementing a distance-based classifier with a quantum interference circuit. EPL (Europhys. Lett.) 119(6), 60002 (2017)","journal-title":"EPL (Europhys. Lett.)"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Schuld, M., et al.: Supervised Learning with Quantum Computers. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96424-9","DOI":"10.1007\/978-3-319-96424-9"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-319-13560-1_17","volume-title":"PRICAI 2014: Trends in Artificial Intelligence","author":"M Schuld","year":"2014","unstructured":"Schuld, M., Sinayskiy, I., Petruccione, F.: Quantum computing for pattern classification. In: Pham, D.-N., Park, S.-B. (eds.) PRICAI 2014. LNCS (LNAI), vol. 8862, pp. 208\u2013220. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13560-1_17"},{"issue":"6","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/TCAD.2005.855930","volume":"25","author":"VV Shende","year":"2006","unstructured":"Shende, V.V., Bullock, S.S., Markov, I.L.: Synthesis of quantum-logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 25(6), 1000\u20131010 (2006)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"8_CR18","volume-title":"Introduction to Data Mining","author":"P Tan","year":"2005","unstructured":"Tan, P., et al.: Introduction to Data Mining. Addison-Wesley, Boston (2005)"},{"issue":"1\u20134","key":"8_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0020-0255(99)00101-2","volume":"124","author":"D Ventura","year":"2000","unstructured":"Ventura, D., et al.: Quantum associative memory. Inf. Sci. 124(1\u20134), 273\u2013296 (2000)","journal-title":"Inf. Sci."},{"key":"8_CR20","first-page":"318","volume":"15","author":"N Wiebe","year":"2018","unstructured":"Wiebe, N., Kapoor, A., Svore, K.M.: Quantum nearest-neighbor algorithms for machine learning. Quantum Inf. Comput. 15, 318\u2013358 (2018)","journal-title":"Quantum Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-05936-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,4]],"date-time":"2023-02-04T20:58:53Z","timestamp":1675544333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-05936-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031059353","9783031059360"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-05936-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/pakdd.net\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"558","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"121","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.45","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}