{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:07:06Z","timestamp":1778605626762,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,6,28]],"date-time":"2009-06-28T00:00:00Z","timestamp":1246147200000},"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":[[2009,6,28]]},"DOI":"10.1145\/1557019.1557092","type":"proceedings-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T13:10:54Z","timestamp":1246367454000},"page":"647-656","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Correlated itemset mining in ROC space"],"prefix":"10.1145","author":[{"given":"Siegfried","family":"Nijssen","sequence":"first","affiliation":[{"name":"K.U.Leuven, Leuven, Belgium, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tias","family":"Guns","sequence":"additional","affiliation":[{"name":"K.U.Leuven, Leuven, Belgium, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"De Raedt","sequence":"additional","affiliation":[{"name":"K.U.Leuven, Leuven, Belgium, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,6,28]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312263"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312219"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/846218.847249"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2006.02.006"},{"key":"e_1_3_2_2_5_1","first-page":"46","volume-title":"PKDD","author":"Bringmann B.","year":"2005","unstructured":"B. Bringmann and A. Zimmermann . Tree2 - decision trees for tree structured data . In PKDD , pages 46 -- 58 , 2005 . B. Bringmann and A. Zimmermann. Tree2 - decision trees for tree structured data. In PKDD, pages 46--58, 2005."},{"key":"e_1_3_2_2_6_1","first-page":"55","volume-title":"InPKDD","author":"Bringmann B.","year":"2006","unstructured":"B. Bringmann , A. Zimmermann , L. De Raedt , and S. Nijssen . Don't be afraid of simpler patterns . InPKDD , pages 55 -- 66 , 2006 . B. Bringmann, A. Zimmermann, L. De Raedt, andS. Nijssen. Don't be afraid of simpler patterns. InPKDD, pages 55--66, 2006."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024076020895"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367917"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497425"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401919"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.127"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312191"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401922"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2005.10.010"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1066513.1066517"},{"key":"e_1_3_2_2_16_1","first-page":"440","volume-title":"ECML\/PKDD (1)","author":"Grosskreutz H.","year":"2008","unstructured":"H. Grosskreutz , S. Ruping , and S. Wrobel . Tight optimistic estimates for fast subgroup discovery . In ECML\/PKDD (1) , pages 440 -- 456 , 2008 . H. Grosskreutz, S. Ruping, and S. Wrobel. Tight optimistic estimates for fast subgroup discovery. In ECML\/PKDD (1), pages 440--456, 2008."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00182-2"},{"key":"e_1_3_2_2_18_1","first-page":"230","volume-title":"IDA","author":"Kavsek B.","year":"2003","unstructured":"B. Kavsek , N. Lavrac , and V. Jovanoski . APRIORI-SD: Adapting association rule learning to subgroup discovery . In IDA , pages 230 -- 241 , 2003 . B. Kavsek, N. Lavrac, and V. Jovanoski. APRIORI-SD: Adapting association rule learning to subgroup discovery. In IDA, pages 230--241, 2003."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502533"},{"key":"e_1_3_2_2_20_1","first-page":"380","volume-title":"VLDB","author":"Morimoto Y.","year":"1998","unstructured":"Y. Morimoto , T. Fukuda , H. Matsuzawa , T. Tokuyama , and K. Yoda . Algorithms for mining association rules for binary segmentations of huge categorical databases . In VLDB , pages 380 -- 391 , 1998 . Y. Morimoto, T. Fukuda, H. Matsuzawa, T. Tokuyama, and K. Yoda. Algorithms for mining association rules for binary segmentations of huge categorical databases. In VLDB, pages 380--391, 1998."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335226"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11733492_10"},{"key":"e_1_3_2_2_23_1","first-page":"823","volume-title":"IJCAI","author":"Prati R. C.","year":"2005","unstructured":"R. C. Prati and P. A. Flach . ROCCER: An algorithm for rule learning based on ROC analysis . In IJCAI , pages 823 -- 828 , 2005 . R. C. Prati and P. A. Flach. ROCCER: An algorithm for rule learning based on ROC analysis. In IJCAI, pages 823--828, 2005."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645806.758215"},{"key":"e_1_3_2_2_25_1","volume-title":"FIMI","author":"Uno T.","year":"2004","unstructured":"T. Uno , M. Kiyomi , and H. Arimura . Lcm ver. 2: Efficient mining algorithms forfrequent\/closed\/maximal itemsets . In FIMI , 2004 . T. Uno, M. Kiyomi, and H. Arimura. Lcm ver. 2: Efficient mining algorithms forfrequent\/closed\/maximal itemsets. In FIMI, 2004."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645801.669035"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376662"},{"key":"e_1_3_2_2_28_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."},{"key":"e_1_3_2_2_29_1","volume-title":"FIMI","author":"Zhu J.","year":"2004","unstructured":"J. Zhu and G. Grahne . Reducing the main memory consumptions of FPmax* and FPclose . In FIMI , 2004 . J. Zhu and G. Grahne. Reducing the main memory consumptions of FPmax* and FPclose. In FIMI, 2004."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.49"}],"event":{"name":"KDD09: The 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Paris France","acronym":"KDD09","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"]},"container-title":["Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557092","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1557019.1557092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:38:41Z","timestamp":1750253921000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1557019.1557092"}},"subtitle":["a constraint programming approach"],"short-title":[],"issued":{"date-parts":[[2009,6,28]]},"references-count":30,"alternative-id":["10.1145\/1557019.1557092","10.1145\/1557019"],"URL":"https:\/\/doi.org\/10.1145\/1557019.1557092","relation":{},"subject":[],"published":{"date-parts":[[2009,6,28]]},"assertion":[{"value":"2009-06-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}