{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T18:29:25Z","timestamp":1768069765084,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,26]],"date-time":"2007-01-26T00:00:00Z","timestamp":1169769600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,1,26]],"date-time":"2007-01-26T00:00:00Z","timestamp":1169769600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2007,2]]},"DOI":"10.1007\/s10618-006-0054-6","type":"journal-article","created":{"date-parts":[[2007,1,25]],"date-time":"2007-01-25T20:25:00Z","timestamp":1169756700000},"page":"171-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":95,"title":["Non-derivable itemset mining"],"prefix":"10.1007","volume":"14","author":[{"given":"Toon","family":"Calders","sequence":"first","affiliation":[]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,1,26]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imilienski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD Int. Conf. Management of Data, Washington, DC, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"54_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proc. VLDB Int. Conf. Very Large Data Bases, Santiago, Chile, pp 487\u2013499"},{"issue":"2","key":"54_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y Bastide","year":"2000","unstructured":"Bastide Y, Taouil R, Pasquier N, Stumme G, Lakhal L (2000) Mining frequent patterns with counting inference. SIGKDD Explor 2(2):66\u201375","journal-title":"SIGKDD Explor"},{"key":"54_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo RJ (1998) Efficiently mining long patterns from databases. In: Proc. ACM SIGMOD Int. Conf. Management of Data, Seattle, Washington, pp 85\u201393","DOI":"10.1145\/276305.276313"},{"key":"54_CR5","first-page":"1","volume":"8","author":"C Bonferroni","year":"1936","unstructured":"Bonferroni C (1936) Teoria statistica della classi e calcolo della probabilit\u00e1. Publicazioni del R. Instituto Superiore di Scienze Economiche e Commerciali di Firenze 8:1\u201362","journal-title":"Publicazioni del R. Instituto Superiore di Scienze Economiche e Commerciali di Firenze"},{"key":"54_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"4","author":"J Boulicaut","year":"2003","unstructured":"Boulicaut J, Bykowski A, Rigotti C (2003) Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Mining Knowledge Discovery 4:5\u201322","journal-title":"Data Mining Knowledge Discovery"},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Boulicaut J-F, Bykowski A (2000) Frequent closures as a concise representation for binary data mining. In: Proc. PaKDD Pacific-Asia Conf. on Knowledge Discovery and Data Mining, pp 62\u201373","DOI":"10.1007\/3-540-45571-X_9"},{"key":"54_CR8","doi-asserted-by":"crossref","unstructured":"Boulicaut, J.-F., A. Bykowski, and C. Rigotti (2000). Approximation of frequency queries by means of free-sets. In Proc. PKDD Int. Conf. Principles of Data Mining and Knowledge Discovery, pp. 75\u201385.","DOI":"10.1007\/3-540-45372-5_8"},{"key":"54_CR9","doi-asserted-by":"crossref","unstructured":"Bykowski A, Rigotti C (2001) A condensed representation to find frequent patterns. In: Proc. PODS Int. Conf. Principles of Database Systems, pp 267\u2013273","DOI":"10.1145\/375551.375604"},{"issue":"8","key":"54_CR10","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1016\/S0306-4379(03)00002-4","volume":"28","author":"A Bykowski","year":"2003","unstructured":"Bykowski A, Rigotti C (2003) DBC: a condensed representation of frequent patterns for efficient mining. J Inform Syst 28(8):949\u2013977","journal-title":"J Inform Syst"},{"key":"54_CR11","unstructured":"Calders T (2003a) Axiomatization and deduction rules for the frequency of itemsets. Ph. D. thesis, University of Antwerp, Belgium"},{"key":"54_CR12","doi-asserted-by":"crossref","unstructured":"Calders T (2003b) Deducing bounds on the support of itemsets. In: Database technologies for data mining, vol 2682 of LNCS, pp 214\u2013233, Springer","DOI":"10.1007\/978-3-540-44497-8_11"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2002) Mining all non-derivable frequent itemsets. In: Proc. PKDD Int. Conf. Principles of Data Mining and Knowledge Discovery, pp 74\u201385. Springer","DOI":"10.1007\/3-540-45681-3_7"},{"key":"54_CR14","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2003) Minimal k-free representations of frequent sets. In: Lavrac N, Gamberger D, Blockeel H, Todorovski L (eds) Proc. PKDD Int. Conf. Principles of Data Mining and Knowledge Discovery, vol 2838 of Lecture Notes in Computer Science, pp 71\u201382. Springer-Verlag.","DOI":"10.1007\/978-3-540-39804-2_9"},{"key":"54_CR15","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2005a) Depth-first non-derivable itemset mining. In: Proc. SIAM Int. Conf. on Data Mining","DOI":"10.1137\/1.9781611972757.23"},{"key":"54_CR16","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2005b) Quick inclusion\u2013exclusion. In: Proceedings ECML-PKDD 2005 Workshop Knowledge Discovery in Inductive Databases, vol 3933 of LNCS, pp 86\u2013103. Springer","DOI":"10.1007\/11733492_6"},{"key":"54_CR17","unstructured":"Dexters N, Calders T (2004) Theoretical bounds on the size of condensed representations. In: Proceedings ECML-PKDD 2004 Workshop Knowledge Discovery in Inductive Databases, pp 25\u201336"},{"key":"54_CR18","unstructured":"Dobra A (2002) Statistical tools for disclosure limitation in multi-way contingency tables. Ph. D. thesis, Department of Statistics, Carnegie Mellon University"},{"issue":"22","key":"54_CR19","doi-asserted-by":"publisher","first-page":"11885","DOI":"10.1073\/pnas.97.22.11885","volume":"97","author":"A Dobra","year":"2000","unstructured":"Dobra A, Fienberg S (2000) Bounds for cell entries in contingency tables given marginal totals and decomposable graphs. Proc Nat Acad Sci 97(22):11885\u201311892","journal-title":"Proc Nat Acad Sci"},{"key":"54_CR20","first-page":"363","volume":"18","author":"A Dobra","year":"2001","unstructured":"Dobra A, Fienberg SE (2001) Bounds for cell entries in contingency tables induced by fixed marginal totals. UNECE Stat J 18:363\u2013371","journal-title":"UNECE Stat J"},{"key":"54_CR21","unstructured":"Fienberg SE (1998) Fr\u00e9chet and bonferroni bounds for multi-way tables of counts with applications to disclosure limitation. In: Statistical data protection (SDP-98), pp 115\u2013129. Eurostat"},{"issue":"14","key":"54_CR22","first-page":"53","volume":"3","author":"M Fr\u00e9chet","year":"1951","unstructured":"Fr\u00e9chet M (1951) Sur les tableaux de correlation dont les marges sont donn\u00e9s. Ann Univ Lyon Sect A, Series 3 14:53\u201377","journal-title":"Ann Univ Lyon Sect A, Series"},{"key":"54_CR23","unstructured":"Galambos J, Simonelli I (1996) Bonferroni-type inequalities with applications. Springer"},{"key":"54_CR24","doi-asserted-by":"crossref","unstructured":"Goethals B, Muhonen J, Toivonen H (2005) Nonderivable association rules. In: Proc. SIAM Int. Conf. on Data Mining","DOI":"10.1137\/1.9781611972757.22"},{"issue":"1","key":"54_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1007730.1007744","volume":"6","author":"B Goethals","year":"2004","unstructured":"Goethals B, Zaki M (2004) Advances in frequent itemset mining implementations: report on fimi\u201903. SIGKDD Explor Newslett 6(1):109\u2013117","journal-title":"SIGKDD Explor Newslett"},{"key":"54_CR26","unstructured":"Groth D, Robertson E (2001) Discovering frequent itemsets in the presence of highly frequent items. In: In Proceedings Workshop on Rule Based Data Mining, in Conjunction with the 14th International Conference On Applications of Prolog"},{"key":"54_CR27","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proc. ACM SIGMOD Int. Conf. Management of Data, Dallas, TX, pp 1\u201312","DOI":"10.1145\/335191.335372"},{"key":"54_CR28","doi-asserted-by":"crossref","unstructured":"Jaroszewicz S, Simivici DA (2002) Support approximations using bonferroni-type inequalities. In: Proc. PKDD Int. Conf. Principles of Data Mining and Knowledge Discovery, pp 212\u2013224","DOI":"10.1007\/3-540-45681-3_18"},{"key":"54_CR29","unstructured":"Jaroszewicz S, Simivici DA, Rosenberg I (2002) An inclusion-exclusion result for boolean polynomials and its applications in data mining. In: Proc. of the Discrete Mathematics in Data Mining Workshop, SIAM Datamining Conference"},{"key":"54_CR30","first-page":"109","volume":"34","author":"C Jordan","year":"1927","unstructured":"Jordan C, (1927) The foundations of the theory of probability. Mat Phys Lapok 34:109\u2013136","journal-title":"Mat Phys Lapok"},{"key":"54_CR31","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01271266","volume":"16","author":"J Kahn","year":"1996","unstructured":"Kahn J, Linial N, Samorodnitsky A (1996) Inclusion-exclusion: Exact and approximate. Combinatorica 16:465\u2013477","journal-title":"Combinatorica"},{"key":"54_CR32","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz M (2001) Concise representation of frequent patterns based on disjunction-free generators. In: Proc. IEEE Int. Conf. on Data Mining, pp 305\u2013312","DOI":"10.1007\/3-540-47887-6_15"},{"key":"54_CR33","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz M, Gajek M (2002a) Concise representation of frequent patterns based on generalized disjunction-free generators In: Proc. PaKDD Pacific-Asia Conf. on Knowledge Discovery and Data Mining, pp 159\u2013171","DOI":"10.1007\/3-540-47887-6_15"},{"key":"54_CR34","doi-asserted-by":"crossref","unstructured":"Kryszkiewicz M, Gajek M (2002b) Why to apply generalized disjunction-free generators representation of frequent patterns? In: Proc. International Syposium on Methodologies for Intelligent Systems, pp 382\u2013392","DOI":"10.1007\/3-540-48050-1_42"},{"key":"54_CR35","unstructured":"Mannila H, Toivonen H (1996) Multiple uses of frequent sets and condensed representations. In: Proc. KDD Int. Conf. Knowledge Discovery in Databases"},{"key":"54_CR36","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(96)00048-0","volume":"73","author":"AA Melkman","year":"1997","unstructured":"Melkman AA, Shimony SE (1997) A note on approximate inclusion-exclusion. Discrete Appl Math 73:23\u201326","journal-title":"Discrete Appl Math"},{"key":"54_CR37","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proc. ICDT Int. Conf. Database Theory, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"5","key":"54_CR38","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/s10115-003-0133-6","volume":"6","author":"J Pei","year":"2004","unstructured":"Pei J, Dong G, Zou W, Han J (2004) Mining condensed frequent-pattern bases. Knowl Inf Syst 6(5):570\u2013594","journal-title":"Knowl Inf Syst"},{"key":"54_CR39","unstructured":"Pei J, Han J, Mao R (2000) Closet: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, TX"},{"issue":"3","key":"54_CR40","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M Zaki","year":"2000","unstructured":"Zaki M, (2000, May\/June). Scalable algorithms for association mining. IEEE Trans Knowledge Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowledge Data Eng"},{"key":"54_CR41","unstructured":"Zaki M, Hsiao C (1999) ChARM: an efficient algorithm for closed association rule mining. In: Technical Report 99-10, Computer Science, Rensselaer Polytechnic Institute"},{"key":"54_CR42","doi-asserted-by":"crossref","unstructured":"Zaki M, Parthasarathy S, Ogihara M, Li W (1997) New algorithms for fast discovery of association rules. In: Heckerman D, Mannila H, Pregibon D (eds), Proceedings of the Third International Conference on Knowledge Discovery and Data Mining, pp 283\u2013286. AAAI Press","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0054-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-006-0054-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0054-6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0054-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T18:11:13Z","timestamp":1630433473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-006-0054-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,26]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2]]}},"alternative-id":["54"],"URL":"https:\/\/doi.org\/10.1007\/s10618-006-0054-6","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,26]]},"assertion":[{"value":"6 December 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}