{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:26:35Z","timestamp":1742952395725,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":45,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387098227"},{"type":"electronic","value":"9780387098234"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-0-387-09823-4_17","type":"book-chapter","created":{"date-parts":[[2010,9,9]],"date-time":"2010-09-09T15:02:00Z","timestamp":1284044520000},"page":"339-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Constraint-based Data Mining"],"prefix":"10.1007","author":[{"given":"Jean-Francois","family":"Boulicaut","sequence":"first","affiliation":[]},{"given":"Baptiste","family":"Jeudy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,7]]},"reference":[{"key":"17_CR1","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\u2013 328. AAAI Press, 1996."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"H. Albert-Lorincz and J.-F. Boulicaut. Mining frequent sequential patterns under regular expressions: a highly adaptative strategy for pushing constraints. In Proc. SIAM DM\u201903, pages 316\u2013320, 2003.","DOI":"10.1137\/1.9781611972733.37"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal nonredundant association rules using frequent closed itemsets. In Proc. CL 2000, volume 1861 of LNCS, pages 972\u2013986. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-44957-4_65"},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. SIGKDD Explorations, 2(2):66\u201375, 2000.","journal-title":"SIGKDD Explorations"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. ACM SIGMOD\u201998, pages 85\u201393, 1998.","DOI":"10.1145\/276305.276313"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. Adaptive constraint pushing in frequent pattern mining. In Proc. PKDD\u201903, volume 2838 of LNAI, pages 47\u201358. Springer-Verlag, 2003A.","DOI":"10.1007\/978-3-540-39804-2_7"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. Examiner: Optimized level-wise frequent pattern mining with monotone constraints. In Proc. IEEE ICDM\u201903, pages 11\u201318, 2003B.","DOI":"10.1109\/ICDM.2003.1250892"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"F. Bonchi, F. Giannotti, A. Mazzanti, and D. Pedreschi. Exante: Anticipated data reduction in constrained pattern mining. In Proc. PKDD\u201903, volume 2838 of LNAI, pages 59\u201370. Springer-Verlag, 2003C.","DOI":"10.1007\/978-3-540-39804-2_8"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"F. Bonchi and C. Lucchese. On closed constrained frequent pattern mining. In Proc. IEEE ICDM\u201904 (In Press), 2004.","DOI":"10.1007\/11430919_15"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut. Inductive databases and multiple uses of frequent itemsets: the cInQ approach. In Database Technologies for Data Mining - Discovering Knowledge with Inductive Queries, volume 2682 of LNCS, pages 1\u201323. Springer-Verlag, 2004.","DOI":"10.1007\/978-3-540-44497-8_1"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut and A. Bykowski. Frequent closures as a concise representation for binary Data Mining. In Proc. PAKDD\u201900, volume 1805 of LNAI, pages 62\u201373. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-45571-X_9"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by mean of free-sets. In Proc. PKDD\u201900, volume 1910 of LNAI, pages 75\u201385. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-45372-5_8"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.-F. Boulicaut","year":"2003","unstructured":"J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets : a condensed representation of boolean data for the approximation of frequency queries. Data Mining and Knowledge Discovery, 7(1):5\u201322, 2003.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"17_CR14","unstructured":"J.-F. Boulicaut and B. Jeudy. Using constraint for itemset mining: should we prune or not? In Proc. BDA\u201900, pages 221\u2013237, 2000."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut and B. Jeudy. Mining free-sets under constraints. In Proc. IEEE IDEAS\u201901, pages 322\u2013329, 2001.","DOI":"10.1109\/IDEAS.2001.938100"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1024076020895","volume":"7","author":"C. Bucila","year":"2003","unstructured":"C. Bucila, J. E. Gehrke, D. Kifer, and W. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. Data Mining and Knowledge Discovery, 7(4):241\u2013272, 2003.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: A maximal frequent itemset algorithm for transactional databases. In Proc. IEEE ICDE\u201901, pages 443\u2013452, 2001.","DOI":"10.1109\/ICDE.2001.914857"},{"issue":"8","key":"17_CR18","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1016\/S0306-4379(03)00002-4","volume":"28","author":"A. Bykowski","year":"2003","unstructured":"A. Bykowski and C. Rigotti. DBC: a condensed representation of frequent patterns for efficient mining. Information Systems, 28(8):949\u2013977, 2003.","journal-title":"Information Systems"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"T. Calders and B. Goethals. Mining all non-derivable frequent itemsets. In Proc. PKDD\u201902, volume 2431 of LNAI, pages 74\u201385. Springer-Verlag, 2002.","DOI":"10.1007\/3-540-45681-3_7"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"B. Cr\u00e9milleux and J.-F. Boulicaut. Simplest rules characterizing classes generated by deltafree sets. In Proc. ES 2002, pages 33\u201346. Springer-Verlag, 2002.","DOI":"10.1007\/978-1-4471-0651-7_3"},{"issue":"2","key":"17_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/772862.772871","volume":"4","author":"L. De Raedt","year":"2003","unstructured":"L. De Raedt. A perspective on inductive databases. SIGKDD Explorations, 4(2):69\u201377, 2003.","journal-title":"SIGKDD Explorations"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"L. De Raedt, M. Jaeger, S. Lee, and H. Mannila. A theory of inductive query answering. In Proc. IEEE ICDM\u201902, pages 123\u2013130, 2002.","DOI":"10.1109\/ICDM.2002.1183894"},{"key":"17_CR23","unstructured":"L. De Raedt and S. Kramer. The levelwise version space algorithm and its application to molecular fragment finding. In Proc. IJCAI\u201901, pages 853\u2013862, 2001."},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/380995.381012","volume":"2","author":"M. M. Garofalakis","year":"2000","unstructured":"M. M. Garofalakis and R. Rastogi. Scalable Data Mining with model constraints. SIGKDD Explorations, 2(2):39\u201348, 2000.","journal-title":"SIGKDD Explorations"},{"key":"17_CR25","unstructured":"M. M. Garofalakis, R. Rastogi, and K. Shim. SPIRIT: Sequential pattern mining with regular expression constraints. In Proc. VLDB\u201999, pages 223\u2013234, 1999."},{"key":"17_CR26","unstructured":"B. Goethals and M. J. Zaki, editors. Proc. of the IEEE ICDM 2003 Workshop on Frequent Itemset Mining Implementations, volume 90 of CEUR Workshop Proceedings, 2003."},{"issue":"2","key":"17_CR27","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/777943.777945","volume":"28","author":"D. Gunopulos","year":"2003","unstructured":"D. Gunopulos, R. Khardon, H. Mannila, S. Saluja, H. Toivonen, and R. S. Sharm. Discovering all most specific sentences. ACM Transactions on Database Systems, 28(2):140\u2013174, 2003.","journal-title":"ACM Transactions on Database Systems"},{"issue":"11","key":"17_CR28","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/240455.240472","volume":"39","author":"T. Imielinski","year":"1996","unstructured":"T. Imielinski and H. Mannila. A database perspective on knowledge discovery. Communications of the ACM, 39(11):58\u201364, 1996.","journal-title":"Communications of the ACM"},{"issue":"4","key":"17_CR29","doi-asserted-by":"crossref","first-page":"341","DOI":"10.3233\/IDA-2002-6404","volume":"6","author":"B. Jeudy","year":"2002","unstructured":"B. Jeudy and J.-F. Boulicaut. Optimization of association rule mining queries. Intelligent Data Analysis, 6(4):341\u2013357, 2002.","journal-title":"Intelligent Data Analysis"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"D. Kifer, J. E. Gehrke, C. Bucila, and W. White. How to quickly find a witness. In Proc. ACM PODS\u201903, pages 272\u2013283, 2003.","DOI":"10.1145\/773153.773180"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"S. Kramer, L. De Raedt, and C. Helma. Molecular feature mining in HIV data. In Proc. ACM SIGKDD\u201901, pages 136\u2013143, 2001.","DOI":"10.1145\/502512.502533"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"L. V. Lakshmanan, R. Ng, J. Han, and A. Pang. Optimization of constrained frequent set queries with 2-variable constraints. In Proc. ACM SIGMOD\u201999, pages 157\u2013168, 1999.","DOI":"10.1145\/304181.304196"},{"issue":"3","key":"17_CR33","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/TKDE.2002.1000342","volume":"14","author":"D.-I. Lin","year":"2002","unstructured":"D.-I. Lin and Z. M. Kedem. Pincer search: An efficient algorithm for discovering the maximum frequent sets. IEEE Transactions on Knowledge and Data Engineering, 14(3):553\u2013566, 2002.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"17_CR34","unstructured":"H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proc. KDD\u201996, pages 189\u2013194. AAAI Press, 1996."},{"issue":"3","key":"17_CR35","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H. Mannila","year":"1997","unstructured":"H. Mannila and H. Toivonen. Levelwise search and borders of theories in knowledge discovery. Data Mining and Knowledge Discovery, 1(3):241\u2013258, 1997.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"2","key":"17_CR36","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0004-3702(91)90040-Q","volume":"52","author":"C. Mellish","year":"1992","unstructured":"C. Mellish. The description identification problem. Artificial Intelligence, 52(2):151\u2013168, 1992.","journal-title":"Artificial Intelligence"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"R. Meo. Optimization of a language for Data Mining. In Proc. ACM SAC\u201903 - Data Mining Track, pages 437\u2013444, 2003.","DOI":"10.1145\/952532.952619"},{"issue":"2","key":"17_CR38","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1009774406717","volume":"2","author":"R. Meo","year":"1998","unstructured":"R. Meo, G. Psaila, and S. Ceri. An extension to SQL for mining association rules. Data Mining and Knowledge Discovery, 2(2):195\u2013224, 1998.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"2","key":"17_CR39","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0004-3702(82)90040-6","volume":"18","author":"T. Mitchell","year":"1980","unstructured":"T. Mitchell. Generalization as search. Artificial Intelligence, 18(2):203\u2013226, 1980.","journal-title":"Artificial Intelligence"},{"key":"17_CR40","doi-asserted-by":"crossref","unstructured":"R. Ng, L. V. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. In Proc. ACM SIGMOD\u201998, pages 13\u201324, 1998.","DOI":"10.1145\/276305.276307"},{"issue":"1","key":"17_CR41","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Information Systems, 24(1):25\u201346, 1999.","journal-title":"Information Systems"},{"key":"17_CR42","unstructured":"J. Pei, G. Dong, W. Zou, and J. Han. On computing condensed frequent pattern bases. In Proc. IEEE ICDM\u201902, pages 378\u2013385, 2002."},{"key":"17_CR43","unstructured":"J. Pei, J. Han, and L. V. S. Lakshmanan. Mining frequent itemsets with convertible constraints. In Proc. IEEE ICDE\u201901, pages 433\u2013442, 2001."},{"key":"17_CR44","unstructured":"R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proc. ACM SIGKDD\u201997, pages 67\u201373, 1997."},{"key":"17_CR45","doi-asserted-by":"crossref","unstructured":"M. J. Zaki. Sequence mining in categorical domains: incorporating constraints. In Proc. ACM CIKM\u201900, pages 422\u2013429, 2000.","DOI":"10.1145\/354756.354849"}],"container-title":["Data Mining and Knowledge Discovery Handbook"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-09823-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T17:32:55Z","timestamp":1740504775000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-09823-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387098227","9780387098234"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-09823-4_17","relation":{},"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"7 July 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}