{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:08:44Z","timestamp":1759205324959,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,24]],"date-time":"2008-08-24T00:00:00Z","timestamp":1219536000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,8,24]]},"DOI":"10.1145\/1401890.1401919","type":"proceedings-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T11:56:41Z","timestamp":1219838201000},"page":"204-212","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["Constraint programming for itemset mining"],"prefix":"10.1145","author":[{"given":"Luc","family":"De Raedt","sequence":"first","affiliation":[{"name":"Katholieke Universiteit Leuven, Leuven, Belgium"}]},{"given":"Tias","family":"Guns","sequence":"additional","affiliation":[{"name":"Katholieke Universiteit Leuven, Leuven, Belgium"}]},{"given":"Siegfried","family":"Nijssen","sequence":"additional","affiliation":[{"name":"Katholieke Universiteit Leuven, Leuven, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2008,8,24]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"307","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Agrawal R.","year":"1996","unstructured":"R. Agrawal , H. Mannila , R. Srikant , H. Toivonen , and A. I. Verkamo . Fast discovery of association rules . In Advances in Knowledge Discovery and Data Mining , pages 307 -- 328 . AAAI Press , 1996 . R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in Knowledge Discovery and Data Mining, pages 307--328. AAAI Press, 1996."},{"key":"e_1_3_2_1_2_1","volume-title":"Constraint Logic Programming using Eclipse","author":"Apt K. R.","year":"2007","unstructured":"K. R. Apt and M. Wallace . Constraint Logic Programming using Eclipse . Cambridge University Press , New York, NY, USA , 2007 . K. R. Apt and M. Wallace. Constraint Logic Programming using Eclipse. Cambridge University Press, New York, NY, USA, 2007."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.5555\/1032649.1033434"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1016\/j.datak.2006.02.006"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1023\/A:1024076020895"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/TKDE.2005.183"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/ICDM.2006.1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/312129.312191"},{"key":"e_1_3_2_1_9_1","first-page":"152","volume-title":"Proc. 15th International Conf. on Machine Learning","author":"Frank E.","year":"1998","unstructured":"E. Frank and I. H. Witten . Using a permutation test for attribute selection in decision trees . In Proc. 15th International Conf. on Machine Learning , pages 152 -- 160 , 1998 . E. Frank and I. H. Witten. Using a permutation test for attribute selection in decision trees. In Proc. 15th International Conf. on Machine Learning, pages 152--160, 1998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/1007730.1007744"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/342009.335372"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/ICDE.2001.914856","volume-title":"Proceedings of the IEEE International Conference on Data Engineering (ICDE)","author":"Pei J.","year":"2001","unstructured":"J. Pei , J. Han , and L. V. S. Lakshmanan . Mining frequent item sets with convertible constraints . In Proceedings of the IEEE International Conference on Data Engineering (ICDE) , pages 433 -- 442 , 2001 . J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent item sets with convertible constraints. In Proceedings of the IEEE International Conference on Data Engineering (ICDE), pages 433--442, 2001."},{"key":"e_1_3_2_1_13_1","volume-title":"Handbook of Constraint Programming (Foundations of Artificial Intelligence)","author":"Rossi F.","year":"2006","unstructured":"F. Rossi , P. van Beek , and T. Walsh . Handbook of Constraint Programming (Foundations of Artificial Intelligence) . Elsevier Science Inc ., 2006 . F. Rossi, P. van Beek, and T. Walsh. Handbook of Constraint Programming (Foundations of Artificial Intelligence). Elsevier Science Inc., 2006."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/1452044.1452046"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/1133905.1133916"},{"key":"e_1_3_2_1_16_1","first-page":"283","volume-title":"KDD","author":"Zaki M. J.","year":"1997","unstructured":"M. J. Zaki , S. Parthasarathy , M. Ogihara , and W. Li . New algorithms for fast discovery of association rules . In KDD , pages 283 -- 286 , 1997 . M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In KDD, pages 283--286, 1997."}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"acronym":"KDD08","name":"KDD08: The 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Las Vegas Nevada USA"},"container-title":["Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401919","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1401890.1401919","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:40Z","timestamp":1750255000000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1401890.1401919"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,24]]},"references-count":16,"alternative-id":["10.1145\/1401890.1401919","10.1145\/1401890"],"URL":"https:\/\/doi.org\/10.1145\/1401890.1401919","relation":{},"subject":[],"published":{"date-parts":[[2008,8,24]]},"assertion":[{"value":"2008-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}