{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T12:46:38Z","timestamp":1791117998307,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642153952","type":"print"},{"value":"9783642153969","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15396-9_44","type":"book-chapter","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T07:00:16Z","timestamp":1283756416000},"page":"552-567","source":"Crossref","is-referenced-by-count":36,"title":["Constraint Programming for Mining n-ary Patterns"],"prefix":"10.1007","author":[{"given":"Mehdi","family":"Khiari","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"}]}],"member":"297","reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-85958-1_31","volume-title":"Principles and Practice of Constraint Programming","author":"M. Benedetti","year":"2008","unstructured":"Benedetti, M., Lallouet, A., Vautard, J.: Quantified constraint optimization. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 463\u2013477. Springer, Heidelberg (2008)"},{"key":"44_CR2","first-page":"144","volume-title":"ICCS 2006","author":"J. Besson","year":"2006","unstructured":"Besson, J., Robardet, C., Boulicaut, J.-F.: Mining a new fault-tolerant pattern type as an alternative to formal concept discovery. In: ICCS 2006, Aalborg, Denmark, pp. 144\u2013157. Springer, Heidelberg (2006)"},{"issue":"1","key":"44_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.is.2008.02.007","volume":"34","author":"F. Bonchi","year":"2009","unstructured":"Bonchi, F., Giannotti, F., Lucchese, C., Orlando, S., Perego, R., Trasarti, R.: A constraint-based querying system for exploratory pattern discovery. Inf. Syst.\u00a034(1), 3\u201327 (2009)","journal-title":"Inf. Syst."},{"key":"44_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-46135-3_25","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"L. Bordeaux","year":"2002","unstructured":"Bordeaux, L., Monfroy, E.: Beyond NP: Arc-consistency for quantified constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 371\u2013386. Springer, Heidelberg (2002)"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Bringmann, B., Zimmermann, A.: The chosen few: On identifying valuable patterns. In: 12th IEEE Int. Conf. on Data Mining (ICDM 2007), pp. 63\u201372 (2007)","DOI":"10.1109\/ICDM.2007.85"},{"key":"44_CR6","unstructured":"Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., Yiu, T.: Mafia: A performance study of mining maximal frequent itemsets. In: FIMI 2003. CEUR Workshop Proceedings, vol.\u00a090, CEUR-WS.org (2003)"},{"key":"44_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11615576_4","volume-title":"Constraint-Based Mining and Inductive Databases","author":"T. Calders","year":"2006","unstructured":"Calders, T., Rigotti, C., Boulicaut, J.-F.: A survey on condensed representations for frequent sets. In: Boulicaut, J.-F., De Raedt, L., Mannila, H. (eds.) Constraint-Based Mining and Inductive Databases. LNCS (LNAI), vol.\u00a03848, pp. 64\u201380. Springer, Heidelberg (2006)"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"De Raedt, L., Guns, T., Nijssen, S.: Constraint Programming for Itemset Mining. In: ACM SIGKDD Int. Conf. KDD 2008, Las Vegas, Nevada, USA (2008)","DOI":"10.1145\/1401890.1401919"},{"key":"44_CR9","volume-title":"7th SIAM Int. Conf. on Data Mining","author":"L. Raedt De","year":"2007","unstructured":"De Raedt, L., Zimmermann, A.: Constraint-based pattern set mining. In: 7th SIAM Int. Conf. on Data Mining. SIAM, Philadelphia (2007)"},{"issue":"3","key":"44_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF00137870","volume":"1","author":"C. Gervet","year":"1997","unstructured":"Gervet, C.: Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints\u00a01(3), 191\u2013244 (1997)","journal-title":"Constraints"},{"key":"44_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-642-04394-9_53","volume-title":"Intelligent Data Engineering and Automated Learning - IDEAL 2009","author":"A. Giacometti","year":"2009","unstructured":"Giacometti, A., Khanjari Miyaneh, E., Marcel, P., Soulet, A.: A framework for pattern-based global models. In: Corchado, E., Yin, H. (eds.) IDEAL 2009. LNCS, vol.\u00a05788, pp. 433\u2013440. Springer, Heidelberg (2009)"},{"key":"44_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/978-3-642-12165-4_35","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2010","author":"M. Khiari","year":"2010","unstructured":"Khiari, M., Boizumault, P., Cr\u00e9milleux, B.: Combining CSP and constraint-based mining for pattern discovery. In: Taniar, D., Gervasi, O., Murgante, B., Pardede, E., Apduhan, B.O. (eds.) ICCSA 2010. LNCS, vol.\u00a06017, pp. 432\u2013447. Springer, Heidelberg (2010)"},{"key":"44_CR13","unstructured":"Knobbe, A., Cr\u00e9milleux, B., F\u00fcrnkranz, J., Scholz, M.: From local patterns to global models: The lego approach to data mining. In: Int. Workshop LeGo co-located with ECML\/PKDD 2008, Antwerp, Belgium, pp. 1\u201316 (2008)"},{"key":"44_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/11871637_58","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"A. Knobbe","year":"2006","unstructured":"Knobbe, A., Ho, E.: Pattern teams. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 577\u2013584. Springer, Heidelberg (2006)"},{"key":"44_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/276304.276307","volume-title":"Proceedings of ACM SIGMOD 1998","author":"R.T. Ng","year":"1998","unstructured":"Ng, R.T., Lakshmanan, V.S., Han, J., Pang, A.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proceedings of ACM SIGMOD 1998, pp. 13\u201324. ACM Press, New York (1998)"},{"key":"44_CR16","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Guns, T., De Raedt, L.: Correlated itemset mining in ROC space: a constraint programming approach. In: KDD 2009, pp. 647\u2013655 (2009)","DOI":"10.1145\/1557019.1557092"},{"key":"44_CR17","unstructured":"Padmanabhan, B., Tuzhilin, A.: A belief-driven method for discovering unexpected patterns. In: KDD, pp. 94\u2013100 (1998)"},{"key":"44_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-75549-4_14","volume-title":"Knowledge Discovery in Inductive Databases","author":"A. Soulet","year":"2007","unstructured":"Soulet, A., Klema, J., Cr\u00e9milleux, B.: Efficient mining under rich constraints derived from various datasets. In: D\u017eeroski, S., Struyf, J. (eds.) KDID 2006. LNCS, vol.\u00a04747, pp. 223\u2013239. Springer, Heidelberg (2007)"},{"issue":"8","key":"44_CR19","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1142\/S0218001402002155","volume":"16","author":"E. Suzuki","year":"2002","unstructured":"Suzuki, E.: Undirected Discovery of Interesting Exception Rules. Int. Journal of Pattern Recognition and Artificial Intelligence\u00a016(8), 1065\u20131086 (2002)","journal-title":"Int. Journal of Pattern Recognition and Artificial Intelligence"},{"key":"44_CR20","doi-asserted-by":"crossref","unstructured":"Szathmary, L., Napoli, A., Valtchev, P.: Towards Rare Itemset Mining. In: Proc. of the 19th IEEE ICTAI 2007, Patras, Greece, vol.\u00a01 (2007)","DOI":"10.1109\/ICTAI.2007.30"},{"key":"44_CR21","doi-asserted-by":"crossref","unstructured":"Yin, X., Han, J.: CPAR: classification based on predictive association rules. In: Proceedings of the 2003 SIAM Int. Conf. on Data Mining, SDM 2003 (2003)","DOI":"10.1137\/1.9781611972733.40"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15396-9_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:53:30Z","timestamp":1619787210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15396-9_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153952","9783642153969"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15396-9_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}