{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T00:59:05Z","timestamp":1781830745713,"version":"3.54.5"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030589417","type":"print"},{"value":"9783030589424","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_9","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"130-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An Ising Framework for Constrained Clustering on Special Purpose Hardware"],"prefix":"10.1007","author":[{"given":"Eldan","family":"Cohen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arik","family":"Senderovich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.3389\/fphy.2019.00048","volume":"7","author":"M Aramon","year":"2019","unstructured":"Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., Katzgraber, H.G.: Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. Front. Phys. 7, 48 (2019)","journal-title":"Front. Phys."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-319-07046-9_31","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"B Babaki","year":"2014","unstructured":"Babaki, B., Guns, T., Nijssen, S.: Constrained clustering using column generation. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 438\u2013454. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-07046-9_31"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Basu, S., Banerjee, A., Mooney, R.J.: Active semi-supervision for pairwise constrained clustering. In: SDM, pp. 333\u2013344. SIAM (2004)","DOI":"10.1137\/1.9781611972740.31"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Basu, S., Davidson, I., Wagstaff, K.: Constrained Clustering: Advances in Algorithms, Theory, and Applications. CRC Press (2008)","DOI":"10.1201\/9781584889977"},{"key":"9_CR5","unstructured":"Bian, Z., Chudak, F., Macready, W.G., Rose, G.: The ising model: teaching an old problem new tricks. D-wave Syst. 2 (2010)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Bilenko, M., Basu, S., Mooney, R.J.: Integrating constraints and metric learning in semi-supervised clustering. In: ICML, pp. 81\u201388 (2004)","DOI":"10.1145\/1015330.1015360"},{"key":"9_CR7","unstructured":"Bradley, P., Bennett, K., Demiriz, A.: Constrained k-means clustering. Microsoft Res. Redmond 20 (2000)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Coffrin, C., Nagarajan, H., Bent, R.: Evaluating ising processing units with integer programming. In: CPAIOR, pp. 163\u2013181 (2019)","DOI":"10.1007\/978-3-030-19212-9_11"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"485","DOI":"10.3233\/IDA-130590","volume":"17","author":"TF Cov\u00f5es","year":"2013","unstructured":"Cov\u00f5es, T.F., Hruschka, E.R., Ghosh, J.: A study of k-means-based algorithms for constrained clustering. Intel. Data Anal. 17(3), 485\u2013505 (2013)","journal-title":"Intel. Data Anal."},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-40994-3_27","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"T-B-H Dao","year":"2013","unstructured":"Dao, T.-B.-H., Duong, K.-C., Vrain, C.: A declarative framework for constrained clustering. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8190, pp. 419\u2013434. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40994-3_27"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-319-23219-5_39","volume-title":"Principles and Practice of Constraint Programming","author":"T-B-H Dao","year":"2015","unstructured":"Dao, T.-B.-H., Duong, K.-C., Vrain, C.: Constrained minimum sum of squares clustering by constraint programming. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 557\u2013573. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23219-5_39"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.artint.2015.05.006","volume":"244","author":"TBH Dao","year":"2017","unstructured":"Dao, T.B.H., Duong, K.C., Vrain, C.: Constrained clustering by constraint programming. Artif. Intell. 244, 70\u201394 (2017)","journal-title":"Artif. Intell."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Davidson, I., Ravi, S.: Clustering with constraints: feasibility issues and the k-means algorithm. In: SDM, pp. 138\u2013149 (2005)","DOI":"10.1137\/1.9781611972757.13"},{"key":"9_CR14","unstructured":"DeGroot, M.H., Schervish, M.J.: Probability and Statistics. Pearson Education (2012)"},{"key":"9_CR15","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). \nhttp:\/\/archive.ics.uci.edu\/ml"},{"key":"9_CR16","unstructured":"Gecode Team: \nhttp:\/\/www.gecode.org"},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","volume":"2","author":"L Hubert","year":"1985","unstructured":"Hubert, L., Arabie, P.: Comparing partitions. J. Classif. 2(1), 193\u2013218 (1985)","journal-title":"J. Classif."},{"key":"9_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-7138-7","volume-title":"An Introduction to Statistical Learning","author":"G James","year":"2013","unstructured":"James, G., Witten, D., Hastie, T., Tibshirani, R.: An Introduction to Statistical Learning. Springer, NewYork (2013). \nhttps:\/\/doi.org\/10.1007\/978-1-4614-7138-7"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Johnson, M.W., et al.: Quantum annealing with manufactured spins. Nature 473(7346), 194 (2011)","DOI":"10.1038\/nature10012"},{"issue":"03","key":"9_CR20","doi-asserted-by":"publisher","first-page":"P03018","DOI":"10.1088\/1742-5468\/2006\/03\/P03018","volume":"2006","author":"HG Katzgraber","year":"2006","unstructured":"Katzgraber, H.G., Trebst, S., Huse, D.A., Troyer, M.: Feedback-optimized parallel tempering Monte Carlo. J. Stat. Mech: Theory Exp. 2006(03), P03018 (2006)","journal-title":"J. Stat. Mech: Theory Exp."},{"issue":"4598","key":"9_CR21","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-017-1809-2","volume":"17","author":"V Kumar","year":"2018","unstructured":"Kumar, V., Bass, G., Tomlin, C., Dulny, J.: Quantum annealing for combinatorial clustering. Quantum Inf. Process. 17(2), 1\u201314 (2018). \nhttps:\/\/doi.org\/10.1007\/s11128-017-1809-2","journal-title":"Quantum Inf. Process."},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Liu, H., Fu, Y.: Clustering with partition level side information. In: IEEE ICDM, pp. 877\u2013882 (2015)","DOI":"10.1109\/ICDM.2015.18"},{"issue":"10","key":"9_CR24","doi-asserted-by":"publisher","first-page":"2469","DOI":"10.1109\/TPAMI.2017.2763945","volume":"40","author":"H Liu","year":"2018","unstructured":"Liu, H., Tao, Z., Fu, Y.: Partition level constrained clustering. IEEE TPAMI 40(10), 2469\u20132483 (2018)","journal-title":"IEEE TPAMI"},{"issue":"2","key":"9_CR25","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many np problems. Front. Phys. 2, 5 (2014)","journal-title":"Front. Phys."},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-00202-1_24","volume-title":"WALCOM: Algorithms and Computation","author":"M Mahajan","year":"2009","unstructured":"Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar k-means problem is NP-hard. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 274\u2013285. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00202-1_24"},{"key":"9_CR28","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-319-61566-0_39","volume-title":"Complex, Intelligent, and Software Intensive Systems","author":"S Matsubara","year":"2018","unstructured":"Matsubara, S., et al.: Ising-model optimizer with parallel-trial bit-sieve engine. In: Barolli, L., Terzo, O. (eds.) CISIS 2017. AISC, vol. 611, pp. 432\u2013438. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-61566-0_39"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-540-74958-5_67","volume-title":"Machine Learning: ECML 2007","author":"D Pelleg","year":"2007","unstructured":"Pelleg, D., Baras, D.: K-means with large and noisy constraint sets. In: Kok, J.N., Koronacki, J., Mantaras, R.L., Matwin, S., Mladeni\u010d, D., Skowron, A. (eds.) ECML 2007. LNCS (LNAI), vol. 4701, pp. 674\u2013682. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74958-5_67"},{"issue":"336","key":"9_CR30","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"WM Rand","year":"1971","unstructured":"Rand, W.M.: Objective criteria for the evaluation of clustering methods. J. Am. Stat. Assoc. 66(336), 846\u2013850 (1971)","journal-title":"J. Am. Stat. Assoc."},{"key":"9_CR31","first-page":"583","volume":"3","author":"A Strehl","year":"2002","unstructured":"Strehl, A., Ghosh, J.: Cluster ensembles\u2013a knowledge reuse framework for combining multiple partitions. J. Mach. Learn. Res. 3, 583\u2013617 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-84858-7","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"H Trevor","year":"2009","unstructured":"Trevor, H., Robert, T., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-0-387-84858-7"},{"issue":"5","key":"9_CR33","first-page":"8","volume":"53","author":"S Tsukamoto","year":"2017","unstructured":"Tsukamoto, S., Takatsu, M., Matsubara, S., Tamura, H.: An accelerator architecture for combinatorial optimization problems. Fujitsu Sci. Tech. J 53(5), 8\u201313 (2017)","journal-title":"Fujitsu Sci. Tech. J"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Ushijima-Mwesigwa, H., Negre, C.F., Mniszewski, S.M.: Graph partitioning using quantum annealing on the d-wave system. In: Proceedings of the Second International Workshop on Post Moores Era Supercomputing, pp. 22\u201329. ACM (2017)","DOI":"10.1145\/3149526.3149531"},{"key":"9_CR35","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schr\u00f6dl, S.: Constrained k-means clustering with background knowledge. In: ICML, pp. 577\u2013584 (2001)"},{"key":"9_CR36","unstructured":"Xing, E.P., Jordan, M.I., Russell, S.J., Ng, A.Y.: Distance metric learning with application to clustering with side-information. In: NIPS, pp. 521\u2013528 (2003)"},{"key":"9_CR37","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/JSSC.2015.2498601","volume":"51","author":"M Yamaoka","year":"2016","unstructured":"Yamaoka, M., Yoshimura, C., Hayashi, M., Okuyama, T., Aoki, H., Mizuno, H.: A 20k-spin ising chip to solve combinatorial optimization problems with CMOS annealing. IEEE J. Solid-State Circuits 51, 303\u2013309 (2016)","journal-title":"IEEE J. Solid-State Circuits"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:06:08Z","timestamp":1600409168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","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":"25","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":"7","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":"35% - 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.08","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":"3.08","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)"}}]}}