{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:15:53Z","timestamp":1743030953182,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501369"},{"type":"electronic","value":"9783319501376"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-50137-6_11","type":"book-chapter","created":{"date-parts":[[2016,12,2]],"date-time":"2016-12-02T10:41:48Z","timestamp":1480675308000},"page":"282-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Partition-Based Clustering Using Constraint Optimization"],"prefix":"10.1007","author":[{"given":"Valerio","family":"Grossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tias","family":"Guns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna","family":"Monreale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirco","family":"Nanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siegfried","family":"Nijssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,3]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","DOI":"10.1201\/b15410","volume-title":"Data Clustering: Algorithms and Applications","author":"CC Aggarwal","year":"2013","unstructured":"Aggarwal, C.C., Reddy, C.K.: Data Clustering: Algorithms and Applications, 1st edn. Chapman & Hall\/CRC, Boca Raton (2013)","edition":"1"},{"key":"11_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, Heidelberg (2014). doi:10.1007\/978-3-319-07046-9_31"},{"key":"11_CR3","volume-title":"Advances in Algorithms, Theory, and Applications","author":"S Basu","year":"2008","unstructured":"Basu, S., Davidson, I., Wagstaff, K., Clustering, C.: Advances in Algorithms, Theory, and Applications, 1st edn. Chapman & Hall\/CRC, Boca Raton (2008)","edition":"1"},{"key":"11_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-260-3","volume-title":"Guide to Intelligent Data Analysis: How to Intelligently Make Sense of Real Data","author":"MR Berthold","year":"2010","unstructured":"Berthold, M.R., Borgelt, C., Hppner, F., Klawonn, F.: Guide to Intelligent Data Analysis: How to Intelligently Make Sense of Real Data, 1st edn. Springer, Heidelberg (2010)","edition":"1"},{"issue":"5","key":"11_CR5","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1002\/sam.10133","volume":"4","author":"M Coscia","year":"2011","unstructured":"Coscia, M., Giannotti, F., Pedreschi, D.: A classification for community discovery methods in complex networks. Stat. Anal. Data Min. 4(5), 512\u2013546 (2011)","journal-title":"Stat. Anal. Data Min."},{"doi-asserted-by":"crossref","unstructured":"Dao, T., Duong, K., Vrain, C.: A filtering algorithm for constrained clustering with within-cluster sum of dissimilarities criterion. In: 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, Herndon, VA, USA, 4\u20136 November 2013, pp. 1060\u20131067 (2013)","key":"11_CR6","DOI":"10.1109\/ICTAI.2013.158"},{"key":"11_CR7","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). doi:10.1007\/978-3-642-40994-3_27"},{"unstructured":"Dao, T.-B.-H., Duong, K.-C., Vrain, C.: Constrained clustering by constraint programming. Artif. Intell. (2015)","key":"11_CR8"},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10618-006-0053-7","volume":"14","author":"I Davidson","year":"2007","unstructured":"Davidson, I., Ravi, S.: The complexity of non-hierarchical clustering with instance and cluster level constraints. Data Min. Knowl. Disc. 14(1), 25\u201361 (2007)","journal-title":"Data Min. Knowl. Disc."},{"doi-asserted-by":"crossref","unstructured":"Davidson, I., Ravi, S.S.: Clustering with constraints: feasibility issues and the k-means algorithm. In: Proceedings of the 2005 SIAM International Conference on Data Mining, SDM 2005, Newport Beach, CA, USA, 21\u201323 April 2005, pp. 138\u2013149 (2005)","key":"11_CR10","DOI":"10.1137\/1.9781611972757.13"},{"issue":"4","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1137\/S1064827597328327","volume":"21","author":"O du Merle","year":"1999","unstructured":"du Merle, O., Hansen, P., Jaumard, B., Mladenovic, N.: An interior point algorithm for minimum sum-of-squares clustering. SIAM J. Sci. Comput. 21(4), 1485\u20131505 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"11_CR12","first-page":"226","volume-title":"KDD","author":"M Ester","year":"1996","unstructured":"Ester, M., Kriegel, H.-P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: Simoudis, E., Han, J., Fayyad, U.M. (eds.) KDD, pp. 226\u2013231. AAAI Press, Menlo Park (1996)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"TF Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"unstructured":"Hansen,P., Aloise, D.: A survey on exact methods for minimum sum-of-squares clustering, pp. 1\u20132, January 2009. http:\/\/www.math.iit.edu\/Buck65files\/msscStLouis.pdf","key":"11_CR14"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"AK Jain","year":"1999","unstructured":"Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Comput. Surv. 31(3), 264\u2013323 (1999)","journal-title":"ACM Comput. Surv."},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-16184-1_12","volume-title":"Discovery Science","author":"M Mueller","year":"2010","unstructured":"Mueller, M., Kramer, S.: Integer linear programming models for constrained clustering. In: Pfahringer, B., Holmes, G., Hoffmann, A. (eds.) DS 2010. LNCS (LNAI), vol. 6332, pp. 159\u2013173. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-16184-1_12"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"036106+","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(2), 036106+ (2007)","journal-title":"Phys. Rev. E"},{"unstructured":"Wagstaff, K., Cardie,C.: Clustering with instance-level constraints. In: Proceedings of the Seventeenth International Conference on Machine Learning (ICML 2000), Stanford University, Stanford, CA, USA, June 29\u2013July 2 2000, pp. 1103\u20131110 (2000)","key":"11_CR18"}],"container-title":["Lecture Notes in Computer Science","Data Mining and Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50137-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:13:08Z","timestamp":1709820788000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50137-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501369","9783319501376"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50137-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"3 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}