{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:31:17Z","timestamp":1760707877913,"version":"3.41.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440376"},{"type":"electronic","value":"9783540456810"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45681-3_7","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T11:03:25Z","timestamp":1192791805000},"page":"74-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":136,"title":["Mining All Non-derivable Frequent Itemsets"],"prefix":"10.1007","author":[{"given":"Toon","family":"Calders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,9,18]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imilienski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. ACM SIGMOD Int. Conf. Management of Data, pages 207\u2013216, Washington, D. C., 1993.","DOI":"10.1145\/170036.170072"},{"key":"7_CR2","unstructured":"R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. VLDB Int. Conf. Very Large Data Bases, pages 487\u2013499, Santiago, Chile, 1994."},{"issue":"2","key":"7_CR3","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. ACM SIGKDD Explorations, 2(2):66\u201374, 2000.","journal-title":"ACM SIGKDD Explorations"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. ACM SIGMOD Int. Conf. Management of Data, pages 85\u201393, Seattle, Washington, 1998.","DOI":"10.1145\/276304.276313"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut and A. Bykowski. Frequent closures as a concise representation for binary data mining. In Proc. P\n                           a\n                           KDD Pacific-Asia Conf. on Knowledge Discovery and Data Mining, pages 62\u201373, 2000.","DOI":"10.1007\/3-540-45571-X_9"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Approximation of frequency queries by means of free-sets. In Proc. PKDD Int. Conf. Principles of Data Mining and Knowledge Discovery, pages 75\u201385, 2000.","DOI":"10.1007\/3-540-45372-5_8"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"A. Bykowski and C. Rigotti. A condensed representation to find frequent patterns. In Proc. PODS Int. Conf. Principles of Database Systems, 2001.","DOI":"10.1145\/375551.375604"},{"key":"7_CR8","unstructured":"T. Calders. Deducing bounds on the frequency of itemsets. In EDBT Workshop DTDM Database Techniques in Data Mining, 2002."},{"key":"7_CR9","volume-title":"The UCI KDD Archive","author":"S. Hettich","year":"1999","unstructured":"S. Hettich and S. D. Bay. The UCI KDD Archive. [http:\/\/kdd.ics.uci.edu]. Irvine, CA: University of California, Department of Information and Computer Science, 1999."},{"key":"7_CR10","volume-title":"Fundamental Algorithms","author":"D. E. Knuth","year":"1997","unstructured":"D. E. Knuth. Fundamental Algorithms. Addison-Wesley, Reading, Massachusetts, 1997."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"M. Kryszkiewicz. Concise representation of frequent patterns based on disjunctionfree generators. In Proc. IEEE Int. Conf. on Data Mining, pages 305\u2013312, 2001.","DOI":"10.1109\/ICDM.2001.989533"},{"key":"7_CR12","unstructured":"H. Mannila and H. Toivonen. Multiple uses of frequent sets and condensed representations. In Proc. KDD Int. Conf. Knowledge Discovery in Databases, 1996."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. In Proc. ICDT Int. Conf. Database Theory, pages 398\u2013416, 1999.","DOI":"10.1007\/3-540-49257-7_25"},{"key":"7_CR14","unstructured":"J. Pei, J. Han, and R. Mao. Closet: An efficient algorithm for mining frequent closed itemsets. In W. Chen, J. F. Naughton, and P. A. Bernstein, editors, ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, TX, 2000."},{"key":"7_CR15","unstructured":"M. J. Zaki and C. Hsiao. ChARM: An efficient algorithm for closed association rule mining. In Technical Report 99-10, Computer Science, Rensselaer Polytechnic Institute, 1999."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In Proc. KDD Int. Conf. Knowledge Discovery in Databases, pages 401\u2013406. ACM Press, 2001.","DOI":"10.1145\/502512.502572"}],"container-title":["Lecture Notes in Computer Science","Principles of Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45681-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:35:33Z","timestamp":1749573333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-45681-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440376","9783540456810"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45681-3_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 September 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}