{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T16:45:40Z","timestamp":1791305140970,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642341557","type":"print"},{"value":"9783642341564","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34156-4_20","type":"book-chapter","created":{"date-parts":[[2012,10,20]],"date-time":"2012-10-20T04:50:18Z","timestamp":1350708618000},"page":"207-218","source":"Crossref","is-referenced-by-count":13,"title":["Constrained Clustering Using SAT"],"prefix":"10.1007","author":[{"given":"Jean-Philippe","family":"M\u00e9tivier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrice","family":"Boizumault","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Cr\u00e9milleux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehdi","family":"Khiari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samir","family":"Loudni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O. Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF Encoding of Boolean Cardinality Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 108\u2013122. Springer, Heidelberg (2003)"},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10618-006-0040-z","volume":"13","author":"A. Banerjee","year":"2006","unstructured":"Banerjee, A., Ghosh, J.: Scalable clustering algorithms with balancing constraints. Data Min. Knowl. Discov.\u00a013(3), 365\u2013395 (2006)","journal-title":"Data Min. Knowl. Discov."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Basu, S., Davidson, I., Wagstaff, K.L.: Constrained Clustering: Advances in Algorithms, Theory, and Applications. Chapman & Hall (2008)","DOI":"10.1201\/9781584889977"},{"key":"20_CR4","series-title":"AFIPS Conference Proceedings","first-page":"307","volume-title":"AFIPS Spring Joint Computing Conference","author":"K.E. Batcher","year":"1968","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: AFIPS Spring Joint Computing Conference. AFIPS Conference Proceedings, vol.\u00a032, pp. 307\u2013314. Thomson Book Company, Washington, D.C (1968)"},{"key":"20_CR5","unstructured":"Berkhin, P.: Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, CA, USA (2002)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Coquery, E., Jabbour, S., Sais, L.: A constraint programming approach for enumerating motifs in a sequence. In: Workshop on Declarative Pattern Mining, ICDM 2011, Vancouver, Canada, pp. 1091\u20131097 (December 2011)","DOI":"10.1109\/ICDMW.2011.10"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Davidson, I., Ravi, S.: Clustering with constraints: Feasibility issues and the k-means algorithm. In: SDM (2005)","DOI":"10.1137\/1.9781611972757.13"},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10618-008-0103-4","volume":"18","author":"I. Davidson","year":"2009","unstructured":"Davidson, I., Ravi, S.: Using instance-level constraints in agglomerative hierarchical clustering: theoretical and empirical results. Data Min. Knowl. Discov.\u00a018(2), 257\u2013282 (2009)","journal-title":"Data Min. Knowl. Discov."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Davidson, I., Ravi, S., Shamis, L.: A SAT-based framework for efficient constrained clustering. In: SDM, pp. 94\u2013105. SIAM (2010)","DOI":"10.1137\/1.9781611972801.9"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"issue":"1-4","key":"20_CR11","first-page":"1","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-boolean constraints into SAT. JSAT\u00a02(1-4), 1\u201326 (2006)","journal-title":"JSAT"},{"issue":"2","key":"20_CR12","first-page":"139","volume":"2","author":"D.H. Fisher","year":"1987","unstructured":"Fisher, D.H.: Knowledge acquisition via incremental conceptual clustering. Machine Learning\u00a02(2), 139\u2013172 (1987)","journal-title":"Machine Learning"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Gilpin, S., Davidson, I.: Incorporating SAT solvers into hierarchical clustering algorithms: an efficient and flexible approach. In: KDD 2011, pp. 1136\u20131144 (2011)","DOI":"10.1145\/2020408.2020585"},{"issue":"12-13","key":"20_CR14","doi-asserted-by":"publisher","first-page":"1951","DOI":"10.1016\/j.artint.2011.05.002","volume":"175","author":"T. Guns","year":"2011","unstructured":"Guns, T., Nijssen, S., De Raedt, L.: Itemset mining: A constraint programming perspective. Artif. Intell.\u00a0175(12-13), 1951\u20131983 (2011)","journal-title":"Artif. Intell."},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-15396-9_44","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"M. Khiari","year":"2010","unstructured":"Khiari, M., Boizumault, P., Cr\u00e9milleux, B.: Constraint Programming for Mining n-ary Patterns. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 552\u2013567. Springer, Heidelberg (2010)"},{"key":"20_CR16","unstructured":"MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, vol.\u00a01, pp. 281\u2013297. University of California Press (1967)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"M\u00e9tivier, J.-P., Boizumault, P., Cr\u00e9milleux, B., Khiari, M., Loudni, S.: A constraint-based language for declarative pattern discovery. In: 27th Annual ACM Symposium on Applied Computing (SAC 2012), March 2012, pp. 438\u2013444 (2012)","DOI":"10.1145\/2245276.2245302"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"C. Sinz","year":"2005","unstructured":"Sinz, C.: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 827\u2013831. Springer, Heidelberg (2005)"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/3-540-44503-X_26","volume-title":"Database Theory - ICDT 2001","author":"A.K.H. Tung","year":"2000","unstructured":"Tung, A.K.H., Han, J., Lakshmanan, L.V.S., Ng, R.T.: Constraint-Based Clustering in Large Databases. In: Van den Bussche, J., Vianu, V. (eds.) ICDT 2001. LNCS, vol.\u00a01973, pp. 405\u2013419. Springer, Heidelberg (2000)"},{"key":"20_CR20","unstructured":"Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: ICML 2000, pp. 1103\u20131110. M. Kaufmann (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Intelligent Data Analysis XI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34156-4_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:46:19Z","timestamp":1620132379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34156-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642341557","9783642341564"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34156-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}