{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T22:58:42Z","timestamp":1791154722750,"version":"4.1.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,7,10]],"date-time":"2008-07-10T00:00:00Z","timestamp":1215648000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1007\/s10618-008-0111-4","type":"journal-article","created":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T04:08:37Z","timestamp":1215576517000},"page":"94-110","source":"Crossref","is-referenced-by-count":32,"title":["Adequate condensed representations of patterns"],"prefix":"10.1007","volume":"17","author":[{"given":"Arnaud","family":"Soulet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Cr\u00e9milleux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,7,10]]},"reference":[{"key":"111_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Bocca JB, Jarke M, Zaniolo C (eds) VLDB\u201994, proceedings of 20th international conference on very large data bases. Morgan Kaufmann, pp 487\u2013499"},{"key":"111_CR2","doi-asserted-by":"crossref","unstructured":"Bastide Y, Pasquier N, Taouil R, Stumme G, Lakhal L (2000) Mining minimal non-redundant association rules using frequent closed itemsets. In: Lloyd JW, Dahl V, Furbach U, Kerber M, Lau K-K, Palamidessi C, Pereira LM, Sagiv Y, Stuckey PJ (eds) Computational logic, vol 1861 of LNCS. Springer, pp 972\u2013986","DOI":"10.1007\/3-540-44957-4_65"},{"key":"111_CR3","unstructured":"Birkhoff G (1967) Lattices theory, vol 25. American Mathematical Society"},{"key":"111_CR4","doi-asserted-by":"crossref","unstructured":"Boulicaut J-F, Bykowski A, Rigotti C (2003) Free-sets: a condensed representation of boolean data for the approximation of frequency queries. Data Min Knowl Discov 7(1):5\u201322. Kluwer Academics Publishers","DOI":"10.1023\/A:1021571501451"},{"issue":"8","key":"111_CR5","doi-asserted-by":"crossref","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. Inf Syst 28(8): 949\u2013977","journal-title":"Inf Syst"},{"key":"111_CR6","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2002) Mining all non-derivable frequent itemsets. In: Proceedings of the 6th European conference on principles of data mining and knowledge discovery (PKDD\u201902), pp 74\u201385","DOI":"10.1007\/3-540-45681-3_7"},{"key":"111_CR7","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2003) Minimal k-free representations of frequent sets. In: Proceedings of the 7th European conference on principles and practice of knowledge discovery in databases (PKDD\u201903), Springer, pp 71\u201382","DOI":"10.1007\/978-3-540-39804-2_9"},{"key":"111_CR8","unstructured":"Calders T, Rigotti C, Boulicaut J-F (2004) A survey on condensed representations for frequent sets. In: Boulicaut J-F, Raedt LD, Mannila H (eds) Constraint-based mining and inductive databases, European workshop on inductive databases and constraint based mining, vol 3848 of LNCS. Springer, pp 64\u201380"},{"key":"111_CR9","doi-asserted-by":"crossref","unstructured":"Casali A, Cicchetti R, Lakhal L (2005) Essential patterns: a perfect cover of frequent patterns. In: Tjoa AM, Trujillo J (eds) Data warehousing and knowledge discovery, 7th international conference, DaWaK 2005, proceedings, vol 3589 of LNCS. Springer, pp 428\u2013437","DOI":"10.1007\/11546849_42"},{"key":"111_CR10","unstructured":"Cr\u00e9milleux B, Boulicaut JF (2002) Simplest rules characterizing classes generated by delta-free sets. In: 22nd international conference on knowledge based systems and applied artificial intelligence, pp 33\u201346"},{"key":"111_CR11","doi-asserted-by":"crossref","unstructured":"Gasmi G, Yahia SB, Nguifo EM, Bouker S (2007) Extraction of association rules based on literalsets. In: Song IY, Eder J, Nguyen TM (eds) Data warehousing and knowledge discovery, 9th international conference, DaWaK 2007, proceedings, vol 4654 of LNCS. Springer, pp 293\u2013302","DOI":"10.1007\/978-3-540-74553-2_27"},{"key":"111_CR12","unstructured":"Giacometti A, Laurent D, Diop CT (2002) Condensed representations for sets of mining queries. In: Knowledge discovery in inductive databases, 1st international workshop, KDID 2002"},{"key":"111_CR13","unstructured":"Goethals B, Zaki MJ (eds) (2003) FIMI \u201903, frequent itemset mining implementations, proceedings, vol 90 of CEUR workshop proceedings. http:\/\/CEUR-WS.org"},{"issue":"11","key":"111_CR14","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/240455.240472","volume":"39","author":"T Imielinski","year":"1996","unstructured":"Imielinski T, Mannila H (1996) A database perspective on knowledge discovery. Commun ACM 39(11): 58\u201364","journal-title":"Commun ACM"},{"issue":"1\u20132","key":"111_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/09528130512331315882","volume":"17","author":"M Kryszkiewicz","year":"2005","unstructured":"Kryszkiewicz M (2005) Generalized disjunction-free representation of frequent patterns with negation. J Exp Theor Artif Intell 17(1\u20132): 63\u201382","journal-title":"J Exp Theor Artif Intell"},{"key":"111_CR16","doi-asserted-by":"crossref","unstructured":"Li J, Liu G, Wong L (2007) Mining statistically important equivalence classes and delta-discriminative emerging patterns. In: Berkhin P, Caruana R, Wu X (eds) KDD. ACM, pp 430\u2013439","DOI":"10.1145\/1281192.1281240"},{"issue":"3","key":"111_CR17","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H (1997) Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Discov 1(3): 241\u2013258","journal-title":"Data Min. Knowl. Discov"},{"issue":"2","key":"111_CR18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0004-3702(82)90040-6","volume":"18","author":"TM Mitchell","year":"1982","unstructured":"Mitchell TM (1982) Generalization as search. Artif Intell 18(2): 203\u2013226","journal-title":"Artif Intell"},{"key":"111_CR19","doi-asserted-by":"crossref","unstructured":"Morik K, Boulicaut J-F, AS (eds) (2005) Local pattern detection, vol 3539 of LNAI. Springer-Verlag","DOI":"10.1007\/b137601"},{"key":"111_CR20","doi-asserted-by":"crossref","unstructured":"Ng RT, Lakshmanan LVS, Han J, Pang A (1998) Exploratory mining and pruning optimizations of constrained association rules. In: Haas LM, Tiwary A (eds) SIGMOD 1998, proceedings ACM SIGMOD international conference on management of data. ACM Press, pp 13\u201324","DOI":"10.1145\/276304.276307"},{"key":"111_CR21","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Database theory\u2014ICDT \u201999, 7th international conference, proceedings, vol 1540 of LNCS. Springer, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"111_CR22","doi-asserted-by":"crossref","unstructured":"Soulet A, Cr\u00e9milleux B, Rioult F (2004) Condensed representation of EPs and patterns quantified by frequency-based measures. In: Post-proceedings of knowledge discovery in inductive databases, 3rd international workshop, KDID 2004, Pise, Springer","DOI":"10.1007\/978-3-540-31841-5_10"},{"key":"111_CR23","doi-asserted-by":"crossref","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Berry MW, Dayal U, Kamath C, Skillicorn DB (eds) Proceedings of the fourth SIAM international conference on data mining","DOI":"10.1137\/1.9781611972740.51"},{"key":"111_CR24","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2000a) Generating non-redundant association rules. In: KDD, pp 34\u201343","DOI":"10.1145\/347090.347101"},{"issue":"3","key":"111_CR25","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000b) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3): 372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-008-0111-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-008-0111-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-008-0111-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:29:40Z","timestamp":1559244580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-008-0111-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,10]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["111"],"URL":"https:\/\/doi.org\/10.1007\/s10618-008-0111-4","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,10]]}}}