{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:29:37Z","timestamp":1760596177889},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2004,2,9]],"date-time":"2004-02-09T00:00:00Z","timestamp":1076284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowledge and Information Systems"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1007\/s10115-003-0133-6","type":"journal-article","created":{"date-parts":[[2004,7,22]],"date-time":"2004-07-22T03:34:41Z","timestamp":1090467281000},"page":"570-594","source":"Crossref","is-referenced-by-count":34,"title":["Mining Condensed Frequent-Pattern Bases"],"prefix":"10.1007","volume":"6","author":[{"given":"Jian","family":"Pei","sequence":"first","affiliation":[]},{"given":"Guozhu","family":"Dong","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Zou","sequence":"additional","affiliation":[]},{"given":"Jiawei","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,2,9]]},"reference":[{"key":"133_CRAAP01","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"Agarwal","year":"2001","unstructured":"Agarwal R, Aggarwal C, Prasad VVV (2001) A tree projection algorithm for generation of frequent itemsets. J Parallel Distrib Comput 61:350\u2013371","journal-title":"J Parallel Distrib Comput"},{"key":"133_CRAgSr94","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proc 1994 Int Conf Very Large Data Bases (VLDB\u201994), Santiago, Chile, pp 487\u2013499"},{"key":"133_CRAgSr95","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proc 1995 Int Conf Data Engineering (ICDE\u201995), Taipei, Taiwan, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"133_CRBaya98","doi-asserted-by":"crossref","unstructured":"Bayardo RJ (1998) Efficiently mining long patterns from databases. In: Proc 1998 ACM-SIGMOD Int Conf Management of Data (SIGMOD\u201998), Seattle, USA, pp 85\u201393","DOI":"10.1145\/276304.276313"},{"key":"133_CRBEX02","doi-asserted-by":"crossref","unstructured":"Beil F, Ester M, Xu X (2002) Frequent term-based text clustering. In: Proc 2002 ACM SIGKDD Int Conf Knowledge Discovery in Databases (KDD\u201902), Edmonton, Canada, pp 436\u2013442","DOI":"10.1145\/775047.775110"},{"key":"133_CRBeRa99","doi-asserted-by":"crossref","unstructured":"Beyer K, Ramakrishnan R (1999) Bottom-up computation of sparse and iceberg cubes. In: Proc 1999 ACM-SIGMOD Int Conf Management of Data (SIGMOD\u201999), Philadelphia, USA, pp 359\u2013370","DOI":"10.1145\/304182.304214"},{"key":"133_CRBBR00","doi-asserted-by":"crossref","unstructured":"Boulicaut JF, Bykowski A, Rigotti C (2000) Approximation of frequency queries by means of free-sets. In: Principles of Data Mining and Knowledge Discovery, pp 75\u201385","DOI":"10.1007\/3-540-45372-5_8"},{"key":"133_CRBMS97","doi-asserted-by":"crossref","unstructured":"Brin S, Motwani R, Silverstein C (1997) Beyond market basket: generalizing association rules to correlations. In: Proc 1997 ACM-SIGMOD Int Conf Management of Data (SIGMOD\u201997), Tucson, USA, pp 265\u2013276","DOI":"10.1145\/253260.253327"},{"key":"133_CRBCG01","doi-asserted-by":"crossref","unstructured":"Burdick D, Calimlim M, Gehrke J (2001) MAFIA: a maximal frequent itemset algorithm for transactional databases. In: Proc 2001 Int Conf Data Engineering (ICDE\u201901), Heidelberg, Germany, pp 443\u2013452","DOI":"10.1109\/ICDE.2001.914857"},{"key":"133_CRDongPlus01","unstructured":"Dong G, Han J, Lam J, Pei J, Wang K (2001) Mining multi-dimensional constrained gradients in data cubes. In: Proc 2001 Int Conf Very Large Data Bases (VLDB\u201901), Rome, Italy, pp 321\u2013330"},{"key":"133_CRDoLi99","doi-asserted-by":"crossref","unstructured":"Dong G, Li J (1999) Efficient mining of emerging patterns: discovering trends and differences. In: Proc 1999 Int Conf Knowledge Discovery and Data Mining (KDD\u201999), San Diego, USA, pp 43\u201352","DOI":"10.1145\/312129.312191"},{"key":"133_CRGoZa01","doi-asserted-by":"crossref","unstructured":"Gouda K, Zaki MJ (2001) Efficiently mining maximal frequent itemsets. In: ICDM, pp 163\u2013170","DOI":"10.1109\/ICDM.2001.989514"},{"key":"133_CRHDY99","unstructured":"Han J, Dong G, Yin Y (1999) Efficient mining of partial periodic patterns in time series database. In: Proc 1999 Int Conf Data Engineering (ICDE\u201999), Sydney, Australia, pp 106\u2013115"},{"key":"133_CRHPY00","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proc 2000 ACM-SIGMOD Int Conf Management of Data (SIGMOD\u201900), Dallas, USA, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"133_CRIKA02","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1015417610840","volume":"6","author":"Imielinski","year":"2002","unstructured":"Imielinski T, Khachiyan L, Abdulghani A (2002) Cubegrades: generalizing association rules. Data Min Knowl Discovery 6:219\u2013258","journal-title":"Data Min Knowl Discovery"},{"key":"133_CRKHC97","unstructured":"Kamber M, Han J, Chiang JY (1997) Metarule-guided mining of multi-dimensional association rules using data cubes. In: Proc 1997 Int Conf Knowledge Discovery and Data Mining (KDD\u201997), Newport Beach, USA, pp 207\u2013210"},{"key":"133_CRLHM98","unstructured":"Liu B, Hsu W, Ma Y (1998) Integrating classification and association rule mining. In: Proc 1998 Int Conf Knowledge Discovery and Data Mining (KDD\u201998), New York, USA, pp 80\u201386"},{"key":"133_CRLHP01","unstructured":"Li W, Han J, Pei J (2001) CMAR: accurate and efficient classification based on multiple class-association rules. In: Proc 2001 Int Conf Data Mining (ICDM\u201901), San Jose, USA, pp 369\u2013376"},{"key":"133_CRLNHP99","doi-asserted-by":"crossref","unstructured":"Lakshmanan LVS, Ng R, Han J, and Pang A (1999) Optimization of constrained frequent set queries with 2-variable constraints. In: Proc 1999 ACM-SIGMOD Int Conf Management of Data (SIGMOD\u201999), Philadelphia, USA, pp 157\u2013168","DOI":"10.1145\/304182.304196"},{"key":"133_CRLSW97","doi-asserted-by":"crossref","unstructured":"Lent B, Swami A, Widom J (1997) Clustering association rules. In: Proc 1997 Int Conf Data Engineering (ICDE\u201997), Birmingham, England, pp 220\u2013231,","DOI":"10.1109\/ICDE.1997.581756"},{"key":"133_CRMaTo96","unstructured":"Mannila H, Toivonen H (1996) Multiple uses of frequent sets and condensed representations (extended abstract). In: Knowledge Discovery and Data Mining, pp 189\u2013194"},{"key":"133_CRMTV97","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"Mannila","year":"1997","unstructured":"Mannila H, Toivonen H, Verkamo AI (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Discovery 1:259\u2013289","journal-title":"Data Min Knowl Discovery"},{"key":"133_CRMFT01","unstructured":"Margaritis D, Faloutsos C, Thrun S (2001) Netcube: a scalable tool for fast data mining and compression. In: Proc 2001 Int Conf Very Large Data Bases (VLDB\u201901), pp 311\u2013320"},{"key":"133_CRNLHP98","doi-asserted-by":"crossref","unstructured":"Ng R, Lakshmanan LVS, Han J, Pang A (1998) Exploratory mining and pruning optimizations of constrained associations rules. In: Proc 1998 ACM-SIGMOD Int Conf Management of Data (SIGMOD\u201998), Seattle, USA, pp 13\u201324","DOI":"10.1145\/276304.276307"},{"key":"133_CRPBTL99","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proc 7th Int Conf Database Theory (ICDT\u201999), Jerusalem, Israel, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"133_CRPHL01","unstructured":"Pei J, Han J, Lakshmanan LVS (2001) Mining frequent itemsets with convertible constraints. In: Proc 2001 Int Conf Data Engineering (ICDE\u201901), Heidelberg, Germany, pp 433\u2013332"},{"key":"133_CRPHM00","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proc 2000 ACM-SIGMOD Int Workshop Data Mining and Knowledge Discovery (DMKD\u201900), Dallas, USA, pp 11\u201320"},{"key":"133_CRPeiPlus01","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M-C (2001) PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proc 2001 Int Conf Data Engineering (ICDE\u201901), Heidelberg, Germany, pp 215\u2013224"},{"key":"133_CRSBMU98","unstructured":"Silverstein C, Brin S, Motwani R, Ullman J (1998) Scalable techniques for mining causal structures. In: Proc 1998 Int Conf Very Large Data Bases (VLDB\u201998), New York, USA, pp 594\u2013605"},{"key":"133_CRZaki00","doi-asserted-by":"crossref","unstructured":"Zaki M (2000) Generating non-redundant association rules. In: Proc 2000 ACM SIGKDD Int Conf Knowledge Discovery in Databases (KDD\u201900), Boston, USA, pp 34\u201343","DOI":"10.1145\/347090.347101"},{"key":"133_CRZaHs02","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Hsiao CJ (2002) CHARM: an efficient algorithm for closed itemset mining. In: Proc 2002 SIAM Int Conf Data Mining, Arlington, USA, pp 457\u2013473","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-003-0133-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-003-0133-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-003-0133-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T06:10:13Z","timestamp":1559110213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-003-0133-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2,9]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["133"],"URL":"https:\/\/doi.org\/10.1007\/s10115-003-0133-6","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,2,9]]}}}