{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T16:27:18Z","timestamp":1743784038724,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030208691"},{"type":"electronic","value":"9783030208707"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-20870-7_24","type":"book-chapter","created":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T16:14:21Z","timestamp":1558714461000},"page":"383-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Binary Optimization Approach for Constrained K-Means Clustering"],"prefix":"10.1007","author":[{"given":"Huu M.","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Eriksson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanh-Toan","family":"Do","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Milford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,25]]},"reference":[{"key":"24_CR1","unstructured":"Althoff, T., Ulges, A., Dengel, A.: Balanced clustering for content-based image browsing. Series of the Gesellschaft fur Informatik, pp. 27\u201330 (2011)"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.disopt.2006.10.001","volume":"4","author":"L Bertacco","year":"2007","unstructured":"Bertacco, L., Fischetti, M., Lodi, A.: A feasibility pump heuristic for general mixed-integer problems. Discret. Optim. 4(1), 63\u201376 (2007)","journal-title":"Discret. Optim."},{"key":"24_CR3","first-page":"1","volume-title":"Constrained K-Means Clustering","author":"P Bradley","year":"2000","unstructured":"Bradley, P., Bennett, K., Demiriz, A.: Constrained K-Means Clustering, pp. 1\u20138. Microsoft Research, Redmond (2000)"},{"key":"24_CR4","unstructured":"Fard, M.M., Thonet, T., Gaussier, E.: Deep $$k$$-means: jointly clustering with $$k$$-means and learning representations. arXiv preprint arXiv:1806.10069 (2018)"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91\u2013104 (2005)","journal-title":"Math. Program."},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Ge, T., He, K., Ke, Q., Sun, J.: Optimized product quantization for approximate nearest neighbor search. In: 2013 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2946\u20132953. IEEE (2013)","DOI":"10.1109\/CVPR.2013.379"},{"issue":"3","key":"24_CR7","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1137\/16M1069687","volume":"27","author":"B Gei\u00dfler","year":"2017","unstructured":"Gei\u00dfler, B., Morsi, A., Schewe, L., Schmidt, M.: Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps. SIAM J. Optim. 27(3), 1611\u20131636 (2017)","journal-title":"SIAM J. Optim."},{"key":"24_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3626-0","volume-title":"Vector Quantization and Signal Compression","author":"A Gersho","year":"2012","unstructured":"Gersho, A., Gray, R.M.: Vector Quantization and Signal Compression, vol. 159. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-1-4615-3626-0"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2011","unstructured":"Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117\u2013128 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/BF02289588","volume":"32","author":"SC Johnson","year":"1967","unstructured":"Johnson, S.C.: Hierarchical clustering schemes. Psychometrika 32(3), 241\u2013254 (1967)","journal-title":"Psychometrika"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Kalantidis, Y., Avrithis, Y.: Locally optimized product quantization for approximate nearest neighbor search. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2321\u20132328 (2014)","DOI":"10.1109\/CVPR.2014.298"},{"issue":"11","key":"24_CR12","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/j.patrec.2004.04.007","volume":"25","author":"SS Khan","year":"2004","unstructured":"Khan, S.S., Ahmad, A.: Cluster center initialization algorithm for k-means clustering. Pattern Recogn. Lett. 25(11), 1293\u20131302 (2004)","journal-title":"Pattern Recogn. Lett."},{"key":"24_CR13","unstructured":"Le Tan, D.K., Le, H., Hoang, T., Do, T.T., Cheung, N.M.: DeepVQ: a deep network architecture for vector quantization. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition Workshops, pp. 2579\u20132582 (2018)"},{"issue":"11","key":"24_CR14","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Li, Z., Liu, J.: Constrained clustering by spectral kernel learning. In: 2009 IEEE 12th International Conference on Computer Vision, pp. 421\u2013427. IEEE (2009)","DOI":"10.1109\/CVPR.2009.5206852"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Liu, H., Han, J., Nie, F., Li, X.: Balanced clustering with least square regression (2017)","DOI":"10.1609\/aaai.v31i1.10877"},{"key":"24_CR17","unstructured":"MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA, vol. 1, pp. 281\u2013297 (1967)"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2010.05.034","volume":"442","author":"M Mahajan","year":"2012","unstructured":"Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar k-means problem is NP-hard. Theor. Comput. Sci. 442, 13\u201321 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-662-44415-3_4","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"MI Malinen","year":"2014","unstructured":"Malinen, M.I., Fr\u00e4nti, P.: Balanced K-means for clustering. In: Fr\u00e4nti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 32\u201341. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44415-3_4"},{"issue":"Oct","key":"24_CR20","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12(Oct), 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"10","key":"24_CR21","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/S0167-8655(99)00069-0","volume":"20","author":"JM Pena","year":"1999","unstructured":"Pena, J.M., Lozano, J.A., Larranaga, P.: An empirical comparison of four initialization methods for the k-means algorithm. Pattern Recogn. Lett. 20(10), 1027\u20131040 (1999)","journal-title":"Pattern Recogn. Lett."},{"key":"24_CR22","unstructured":"Rifkin, R.M., Lippert, R.A.: Notes on regularized least squares (2007)"},{"key":"24_CR23","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schroedl, S.: Constrained k-means clustering with background knowledge. In: Proceedings of the Eighteenth International Conference on Machine Learning, pp. 577\u2013584. Citeseer (2001)"},{"issue":"67\u201368","key":"24_CR24","first-page":"7","volume":"35","author":"S Wright","year":"1999","unstructured":"Wright, S., Nocedal, J.: Numerical optimization. Springer Sci. 35(67\u201368), 7 (1999)","journal-title":"Springer Sci."},{"key":"24_CR25","unstructured":"Yang, B., Fu, X., Sidiropoulos, N.D., Hong, M.: Towards k-means-friendly spaces: simultaneous deep learning and clustering. arXiv preprint arXiv:1610.04794 (2016)"},{"issue":"8","key":"24_CR26","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/j.knosys.2010.06.003","volume":"23","author":"S Zhu","year":"2010","unstructured":"Zhu, S., Wang, D., Li, T.: Data clustering with size constraints. Knowl.-Based Syst. 23(8), 883\u2013889 (2010)","journal-title":"Knowl.-Based Syst."}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20870-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,18]],"date-time":"2022-09-18T16:20:04Z","timestamp":1663518004000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20870-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030208691","9783030208707"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20870-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"25 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACCV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Conference on Computer Vision","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perth, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"accv2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/accv2018.net\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"979","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":"274","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":"28% - 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","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":"2.7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}