{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T08:08:22Z","timestamp":1767773302371,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031605963"},{"type":"electronic","value":"9783031605970"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-60597-0_4","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:39Z","timestamp":1716818679000},"page":"51-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficiently Mining Closed Interval Patterns with\u00a0Constraint Programming"],"prefix":"10.1007","author":[{"given":"Djawad","family":"Bekkoucha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdelkader","family":"Ouali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrice","family":"Boizumault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Cr\u00e9milleux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Belfodil, A., Kuznetsov, S.O., Robardet, C., Kaytoue, M.: Mining convex polygon patterns with formal concept analysis. In: Sierra, C. (ed.) IJCAI, pp. 1425\u20131432 (2017)","DOI":"10.24963\/ijcai.2017\/197"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11615576_4","volume-title":"Constraint-Based Mining and Inductive Databases","author":"T Calders","year":"2005","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, vol. 3848, pp. 64\u201380. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11615576_4"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1613\/jair.1.11870","volume":"67","author":"M Chabert","year":"2020","unstructured":"Chabert, M., Solnon, C.: A global constraint for the exact cover problem: application to conceptual clustering. J. Artif. Intell. Res. 67, 509\u2013547 (2020)","journal-title":"J. Artif. Intell. Res."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Codocedo, V., Napoli, A.: A proposition for combining pattern structures and relational concept analysis. In: ICFCA, pp. 96 \u2013 111 (2014)","DOI":"10.1007\/978-3-319-07248-7_8"},{"key":"4_CR5","unstructured":"Dao, T., Vrain, C., Duong, K., Davidson, I.: A framework for actionable clustering using constraint programming. In: ECAI, pp. 453\u2013461. Frontiers in Artificial Intelligence and Applications (2016)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Dougherty, J., Kohavi, R., Sahami, M.: Supervised and unsupervised discretization of continuous features. In: Machine Learning: Proceeding of the Twelfth International Conference, pp. 194\u2013202. Morgan Kaufmann (1995)","DOI":"10.1016\/B978-1-55860-377-6.50032-3"},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TKDE.2011.204","volume":"25","author":"T Guns","year":"2013","unstructured":"Guns, T., Nijssen, S., De Raedt, L.: k-pattern set mining under constraints. IEEE Trans. Knowl. Data Eng. 25(2), 402\u2013418 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Kaytoue, M., Kuznetsov, S., Napoli, A.: Revisiting numerical pattern mining with formal concept analysis. IJCAI (2011)","DOI":"10.1007\/978-3-642-20514-9_12"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-15396-9_44","volume-title":"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. 6308, pp. 552\u2013567. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_44"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-319-44953-1_22","volume-title":"CP 2016","author":"N Lazaar","year":"2016","unstructured":"Lazaar, N., et al.: A global constraint for closed frequent pattern mining. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 333\u2013349. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_22"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/s10618-021-00799-9","volume":"36","author":"T Makhalova","year":"2022","unstructured":"Makhalova, T., Kuznetsov, S.O., Napoli, A.: Mint: MDL-based approach for mining interesting numerical pattern sets. Data Min. Knowl. Discov. 36, 108\u2013145 (2022)","journal-title":"Data Min. Knowl. Discov."},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s10618-020-00703-x","volume":"35","author":"M Meeng","year":"2021","unstructured":"Meeng, M., Knobbe, A.J.: For real: a thorough look at numeric attributes in subgroup discovery. Data Min. Knowl. Discov. 35(1), 158\u2013212 (2021)","journal-title":"Data Min. Knowl. Discov."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-030-47436-2_9","volume-title":"PAKDD 2020","author":"A Millot","year":"2020","unstructured":"Millot, A., Cazabet, R., Boulicaut, J.: Optimal subgroup discovery in purely numerical data. In: Lauw, H., Wong, R.W., Ntoulas, A., Lim, E.P., Ng, S.K., Pan, S. (eds.) PAKDD 2020. LNCS, vol. 12085, pp. 112\u2013124. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-47436-2_9"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Nguyen, H.V., Vreeken, J.: Flexibly mining better subgroups. In: Venkatasubramanian, S.C., Jr., W.M. (eds.) Proceedings of the SIAM International Conference on Data Mining, USA, pp. 585\u2013593. SIAM (2016). https:\/\/doi.org\/10.1137\/1.9781611974348.66","DOI":"10.1137\/1.9781611974348.66"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Nijssen, S., Zimmermann, A.: Constraint-based pattern mining. In: Aggarwal, C., Han, J. (eds.) Frequent Pattern Mining, pp. 147\u2013163. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-07821-2_7","DOI":"10.1007\/978-3-319-07821-2_7"},{"key":"4_CR16","unstructured":"Raedt, L.D., Guns, T., Nijssen, S.: Constraint programming for data mining and machine learning. In: AAAI (2010)"},{"key":"4_CR17","unstructured":"Salleb-Aouissi, A., Vrain, C., Nortet, C.: Quantminer: a genetic algorithm for mining quantitative association rules. In: Veloso, M.M. (ed.) IJCAI, pp. 1035\u20131040 (2007)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Song, C., Ge, T.: Discovering and managing quantitative association rules. In: CIKM 2013, pp. 2429\u20132434 (2013)","DOI":"10.1145\/2505515.2505611"},{"key":"4_CR19","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: LCM: an efficient algorithm for enumerating frequent closed item sets. In: Proceedings of the ICDM Workshop on Frequent Itemset Mining Implementations (2003)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Witteveen, J., Duivesteijn, W., Knobbe, A.J., Gr\u00fcnwald, P.: Realkrimp - finding hyperintervals that compress with MDL for real-valued data. In: IDA, pp. 368\u2013379 (2014)","DOI":"10.1007\/978-3-319-12571-8_32"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-60597-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:54Z","timestamp":1716818694000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60597-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031605963","9783031605970"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60597-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}