{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:50:25Z","timestamp":1758268225007},"publisher-location":"Heidelberg","reference-count":15,"publisher":"Physica-Verlag HD","isbn-type":[{"type":"print","value":"9783790813470"},{"type":"electronic","value":"9783790818345"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/978-3-7908-1834-5_39","type":"book-chapter","created":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T23:13:39Z","timestamp":1354403619000},"page":"425-434","source":"Crossref","is-referenced-by-count":12,"title":["Towards the Tractable Discovery of Association Rules with Negations"],"prefix":"10.1007","author":[{"given":"Jean-Fran\u00e7ois","family":"Boulicaut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Bykowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baptiste","family":"Jeudy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","first-page":"207","volume-title":"Proc. ACM SIGMOD93","author":"R Agrawal","year":"1993","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules Between Sets of Items in Large Databases. In Proc. ACM SIGMOD\u201993, 207\u2013216, 1993."},{"key":"39_CR2","volume-title":"Advances in Knowledge Discovery and Data Mining, 307-328. AAAI Press","author":"R Agrawal","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, 307\u2013328. AAAI Press, 1996."},{"key":"39_CR3","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, LNAI 1805,62\u201373, Kyoto, JP, 2000. Springer.","DOI":"10.1007\/3-540-45571-X_9"},{"key":"39_CR4","unstructured":"J.-F. Boulicaut and B. Jeudy. Using Constraints During Set Mining: Should We Prune or not? In Proc. BDA\u201900,Blois, F, 2000. INRIA. to appear."},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut, M. Klemettinen, and H. Mannila. Querying Inductive Databases: A Case Study on the MINE RULE Operator. In Proc. PKDD\u201998, LNAI 1510, 194\u2013202, Nantes, F, 1998. Springer.","DOI":"10.1007\/BFb0094820"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"L. Dehaspe and L. D. Raedt. Mining Association Rules in Multiple Relations. In Proc. ILP\u201997, LNAI 1297, 125\u2013132. 1997. Springer.","DOI":"10.1007\/3540635149_40"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"F. Giannotti and G. Manco. Querying Inductive Databases via Logic-Based User Defined Aggregates. In Proc. PKDD\u201999, LNAI 1704,125\u2013135, Praha, CZ, 1999. Springer.","DOI":"10.1007\/978-3-540-48247-5_14"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"S. Guillaume, F. Guillet, and J. Philipp\u00e9. Improving the Discovery of Association Rules with Intensity of Implication (short paper). In Proc. PKDD\u201998, LNAI 1510, 318\u2013327, Nantes, F, 1998. Springer.","DOI":"10.1007\/BFb0094834"},{"key":"39_CR9","first-page":"420","volume-title":"Proc. VLDB95","author":"J Han","year":"1995","unstructured":"J. Han and Y. Fu. Discovery of Multiple-Level Association Rules from Large Databases. In Proc. VLDB\u201995, 420\u2013431, Z\u00fcrich, CH, 1995."},{"issue":"11","key":"39_CR10","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, Nov. 1996.","journal-title":"Communications of the ACM"},{"key":"39_CR11","unstructured":"M. Klemettinen. Rule Discovery from Telecommunication Network Alarm Databases. PhD thesis, Dept. of Comp. Sc., Univ. of Helsinki, Jan. 1999."},{"key":"39_CR12","first-page":"189","volume-title":"Proc. KDD96","author":"H Mannila","year":"1996","unstructured":"H. Mannila and H. Toivonen. Multiple Uses of Frequent Sets and Condensed Representations. In Proc. KDD\u201996, 189\u2013194, Portland, USA, 1996."},{"issue":"3","key":"39_CR13","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"},{"key":"39_CR14","first-page":"13","volume-title":"Proc. ACM SIGMOD98","author":"R Ng","year":"1998","unstructured":"R. Ng, L. V. Lakshmanan, J. Han, and A. Pang. Exploratory Mining and Pruning Optimization of Constrained Association Rules. In Proc. ACM SIGMOD\u201998, 13\u201324, Seattle, USA, 1998."},{"issue":"1","key":"39_CR15","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"}],"container-title":["Flexible Query Answering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7908-1834-5_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T10:36:23Z","timestamp":1606127783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-7908-1834-5_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783790813470","9783790818345"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-7908-1834-5_39","relation":{},"subject":[],"published":{"date-parts":[[2001]]}}}