{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:39:39Z","timestamp":1743075579737,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030217402"},{"type":"electronic","value":"9783030217419"}],"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-21741-9_9","type":"book-chapter","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T23:09:30Z","timestamp":1560812970000},"page":"81-91","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Condorcet Optimal Clustering with Delaunay Triangulation: Climate Zones and World Happiness Insights"],"prefix":"10.1007","author":[{"given":"Max","family":"Bassett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Blake","family":"Newton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Schlessinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacob","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Lynch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Kuiper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Morse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Pleuss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Travis","family":"Russell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,5]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Ah-Pine, J., Marcotorchino, J.F.: Overview of the relational analysis approach in data-mining and multi-criteria decision making. In: Web Intelligence and Intelligent Agents. InTech (2010)","DOI":"10.5772\/8387"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF00127080","volume":"1","author":"A Atamt\u00fcrk","year":"1996","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., Savelsbergh, M.W.: A combined lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems. J. Heuristics 1(2), 247\u2013259 (1996)","journal-title":"J. Heuristics"},{"key":"9_CR3","unstructured":"Bertsimas, D., Allison, K., Pulleyblank, W.R.: The Analytics Edge. Dynamic Ideas LLC (2016)"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/03610927408827101","volume":"3","author":"T Cali\u0144ski","year":"1974","unstructured":"Cali\u0144ski, T., Harabasz, J.: A dendrite method for cluster analysis. Commun. Stat.-Theory Methods 3(1), 1\u201327 (1974)","journal-title":"Commun. Stat.-Theory Methods"},{"key":"9_CR5","unstructured":"Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, vol. 96, pp. 226\u2013231 (1996)"},{"issue":"11","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1109\/TPAMI.2006.227","volume":"28","author":"P Franti","year":"2006","unstructured":"Franti, P., Virmajoki, O., Hautamaki, V.: Fast agglomerative clustering using a k-nearest neighbor graph. IEEE Trans. Pattern Anal. Mach. Intell. 28(11), 1875\u20131881 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9_CR7","series-title":"Springer Series in Statistics","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning","author":"J Friedman","year":"2001","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: The Elements of Statistical Learning. Springer Series in Statistics, vol. 1. Springer, New York (2001). https:\/\/doi.org\/10.1007\/978-0-387-21606-5"},{"issue":"1\u20133","key":"9_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45(1\u20133), 59\u201396 (1989)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"9_CR9","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: Facets of the clique partitioning polytope. Math. Program. 47(1\u20133), 367\u2013387 (1990)","journal-title":"Math. Program."},{"key":"9_CR10","unstructured":"Helliwell, J.F., L.R., Sachs, J.: World happiness report 2015 (2015)"},{"issue":"8","key":"9_CR11","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A.K.: Data clustering: 50 years beyond k-means. Pattern Recogn. Lett. 31(8), 651\u2013666 (2010)","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF00977785","volume":"9","author":"D Lee","year":"1980","unstructured":"Lee, D., Schachter, B.J.: Two algorithms for constructing a Delaunay triangulation. Int. J. Comput. Inf. Sci. 9(3), 219\u2013242 (1980)","journal-title":"Int. J. Comput. Inf. Sci."},{"issue":"2","key":"9_CR13","first-page":"21","volume":"30","author":"F Marcotorchino","year":"1982","unstructured":"Marcotorchino, F., Michaud, P.: Agregation de similarites en classification automatique. Rev. Stat. Appl. 30(2), 21\u201344 (1982)","journal-title":"Rev. Stat. Appl."},{"issue":"11","key":"9_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.21105\/joss.00205","volume":"2","author":"L McInnes","year":"2017","unstructured":"McInnes, L., Healy, J., Astels, S.: HDBSCAN: hierarchical density based clustering. J. Open Source Softw. 2(11), 205 (2017)","journal-title":"J. Open Source Softw."},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","volume":"22","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra, A., Trick, M.A.: Cliques and clustering: a combinatorial approach. Oper. Res. Lett. 22(1), 1\u201312 (1998)","journal-title":"Oper. Res. Lett."},{"key":"9_CR16","unstructured":"Meila, M., Shi, J.: Learning segmentation by random walks. In: Advances in Neural Information Processing Systems, pp. 873\u2013879 (2001)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Miyauchi, A., Sonobe, T., Sukegawa, N.: Exact clustering via integer programming and maximum satisfiability. In: AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11519"},{"issue":"1","key":"9_CR18","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s11590-014-0754-6","volume":"9","author":"A Miyauchi","year":"2015","unstructured":"Miyauchi, A., Sukegawa, N.: Redundant constraints in the standard formulation for the clique partitioning problem. Optim. Lett. 9(1), 199\u2013207 (2015)","journal-title":"Optim. Lett."},{"key":"9_CR19","unstructured":"Ng, A.Y., Jordan, M.I., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems, pp. 849\u2013856 (2002)"},{"key":"9_CR20","unstructured":"NOAA: Comparative climatic data. National Centers for Environmental Information (2015). https:\/\/www.ncdc.noaa.gov\/ghcn\/comparative-climatic-data"},{"issue":"4","key":"9_CR21","first-page":"209","volume":"38","author":"M Oosten","year":"2001","unstructured":"Oosten, M., Rutten, J.H., Spieksma, F.C.: The clique partitioning problem: facets and patching facets. Netw. Int. J. 38(4), 209\u2013226 (2001)","journal-title":"Netw. Int. J."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"PJ Rousseeuw","year":"1987","unstructured":"Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53\u201365 (1987)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s11634-013-0135-5","volume":"7","author":"N Sukegawa","year":"2013","unstructured":"Sukegawa, N., Yamamoto, Y., Zhang, L.: Lagrangian relaxation and pegging test for the clique partitioning problem. Adv. Data Anal. Classif. 7(4), 363\u2013391 (2013)","journal-title":"Adv. Data Anal. Classif."}],"container-title":["Lecture Notes in Computer Science","Social, Cultural, and Behavioral Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21741-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:36:27Z","timestamp":1709832987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-21741-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030217402","9783030217419"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21741-9_9","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":"5 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SBP-BRiMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Social Computing, Behavioral-Cultural Modeling and Prediction and Behavior Representation in Modeling and Simulation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Washington, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sbp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sbp-brims.org\/2019\/","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":"28","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":"39% - 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":"3","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)"}}]}}