{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:53Z","timestamp":1725486113587},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540441489"},{"type":"electronic","value":"9783540457282"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45728-3_9","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T01:01:03Z","timestamp":1181178063000},"page":"110-124","source":"Crossref","is-referenced-by-count":6,"title":["Constraint-Based Discovery and Inductive Queries: Application to Association Rule Mining"],"prefix":"10.1007","author":[{"given":"Baptiste","family":"Jeudy","sequence":"first","affiliation":[]},{"given":"Boulicaut","family":"Jean-Fran\u00e7ois","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings SIGMOD\u201993, pages 207\u2013216, Washington, USA, 1993. ACM Press.","DOI":"10.1145\/170035.170072"},{"key":"9_CR2","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\u2013328. AAAI Press, 1996."},{"key":"9_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Proceedings CL 2000","author":"Y. Bastide","year":"2000","unstructured":"Y. Bastide, N. Pasquier, R. Taouil, G. Stumme, and L. Lakhal. Mining minimal non-redundant association rules using frequent closed itemsets. In Proceedings CL 2000, volume 1861 of LNCS, pages 972\u2013986, London, UK, 2000. Springer-Verlag."},{"issue":"2","key":"9_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, Dec. 2000.","journal-title":"SIGKDD Explorations"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"M. Botta, J.-F. Boulicaut, C. Masson, and R. Meo. A comparison between query languages for the extraction of association rules. In Proceedings DaWaK\u201902, Aix en Provence, F, 2002. Springer-Verlag. To appear.","DOI":"10.1007\/3-540-46145-0_1"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut and A. Bykowski. Frequent closures as a concise representation for binary data mining. In Proceedings PAKDD\u201900, volume 1805 of LNAI, pages 62\u201373, Kyoto, JP, 2000. Springer-Verlag.","DOI":"10.1007\/3-540-45571-X_9"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut, A. Bykowski, and B. Jeudy. Towards the tractable discovery of association rules with negations. In Proceedings FQAS\u201900, Advances in Soft Computing series, pages 425\u2013434, Warsaw, PL, Oct. 2000. Springer-Verlag.","DOI":"10.1007\/978-3-7908-1834-5_39"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by means of free-sets. In Proceedings PKDD\u201900, volume 1910 of LNAI, pages 75\u201385, Lyon, F, 2000. Springer-Verlag.","DOI":"10.1007\/3-540-45372-5_8"},{"key":"9_CR9","unstructured":"J.-F. Boulicaut and B. Jeudy. Using constraint for itemset mining: should we prune or not? In Proceedings BDA\u201900, pages 221\u2013237, Blois, F, 2000."},{"key":"9_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/3-540-48298-9_31","volume-title":"Proceedings DaWaK\u201999","author":"J.-F. Boulicaut","year":"1999","unstructured":"J.-F. Boulicaut, M. Klemettinen, and H. Mannila. Modeling KDD processes within the inductive database framework. In Proceedings DaWaK\u201999, volume 1676 of LNCS, pages 293\u2013302, Florence, I, 1999. Springer-Verlag."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"A. Bykowski and C. Rigotti. A condensed representation to find frequent patterns. In Proceedings PODS\u201901, pages 267\u2013273, Santa Barbara, USA, 2001. ACM Press.","DOI":"10.1145\/375551.375604"},{"key":"9_CR12","unstructured":"M. M. Garofalakis, R. Rastogi, and K. Shim. SPIRIT: Sequential pattern mining with regular expression constraints. In Proceedings VLDB\u201999, pages 223\u2013234, Edinburgh, UK, 1999. Morgan Kaufmann."},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"B. Goethals and J. van den Bussche. On implementing interactive association rule mining. In Proceedings of the ACM SIGMOD Workshop DMKD\u201999, Philadelphia, USA, 1999.","DOI":"10.1007\/3-540-44466-1_31"},{"key":"9_CR14","volume-title":"Data Mining: Concepts and techniques","author":"J. Han","year":"2000","unstructured":"J. Han and M. Kamber. Data Mining: Concepts and techniques. Morgan Kaufmann Publishers, San Francisco, USA, 2000. 533 pages."},{"issue":"11","key":"9_CR15","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":"9_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1023\/A:1009816913055","volume":"3","author":"T. Imielinski","year":"1999","unstructured":"T. Imielinski and A. Virmani. MSQL: A query language for database mining. Data Mining and Knowledge Discovery, 3(4):373\u2013408, 1999.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"B. Jeudy and J.-F. Boulicaut. Optimization of association rule mining queries. Intelligent Data Analysis, 6(5), 2002. To appear.","DOI":"10.3233\/IDA-2002-6404"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"B. Jeudy and J.-F. Boulicaut. Using condensed representations for interactive association rule mining. In Proceedings PKDD\u201902, Helsinki, FIN, 2002. Springer-Verlag. To appear.","DOI":"10.1007\/3-540-45681-3_19"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"M. Kryszkiewicz. Concise representations of association rules. In Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery, London, UK, 2002. Springer-Verlag. To appear in this volume.","DOI":"10.1007\/3-540-45728-3_8"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"H. Mannila and P. Smyth. Approximate query answering with frequent sets and maximum entropy. In Proceedings ICDE\u201900, page 309, San Diego, USA, 2000. IEEE Computer Press.","DOI":"10.1109\/ICDE.2000.839426"},{"key":"9_CR21","unstructured":"H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proceedings KDD\u201996, pages 189\u2013194, Portland, USA, 1996. AAAI Press."},{"issue":"3","key":"9_CR22","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":"9_CR23","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"},{"key":"9_CR24","unstructured":"P. Moen. Attribute, Event Sequence, and Event Type Similarity Notions for Data Mining. PhD thesis, Department of Computer Science, P.O. Box 26, FIN-00014 University of Helsinki, Jan. 2000."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"B. Nag, P. M. Deshpande, and D. J. DeWitt. Using a knowledge cache for interactive discovery of association rules. In Proceedings SIGKDD\u201999, pages 244\u2013253. ACM Press, 1999.","DOI":"10.1145\/312129.312238"},{"key":"9_CR26","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 Proceedings SIGMOD\u201998, pages 13\u201324, Seattle, USA, 1998. ACM Press.","DOI":"10.1145\/276304.276307"},{"issue":"1","key":"9_CR27","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":"9_CR28","unstructured":"J. Pei, J. Han, and R. Mao. CLOSET an efficient algorithm for mining frequent closed itemsets. In Proceedings of the ACM SIGMOD Workshop DMKD\u201900, pages 21\u201330, Dallas, USA, 2000."},{"issue":"4","key":"9_CR29","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/69.149926","volume":"4","author":"P. Smyth","year":"1992","unstructured":"P. Smyth and R. M. Goodman. An information theoretic approach to rule induction from databases. IEEE Transactions on Knowledge and Data Engineering, 4(4):301\u2013316, 1992.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9_CR30","unstructured":"R. Srikant, Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proceedings KDD\u201997, pages 67\u201373, Newport Beach, USA, 1997. AAAI Press."},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"M. J. Zaki. Generating non-redundant association rules. In Proceedings ACM SIGKDD\u201900, pages 34\u201343, Boston, USA, 2000. ACM Press.","DOI":"10.1145\/347090.347101"}],"container-title":["Lecture Notes in Computer Science","Pattern Detection and Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45728-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T07:18:45Z","timestamp":1683875925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45728-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441489","9783540457282"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-45728-3_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}