{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T16:58:09Z","timestamp":1787677089875,"version":"build-2784847793"},"reference-count":182,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,27]],"date-time":"2007-01-27T00:00:00Z","timestamp":1169856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2007,1,27]],"date-time":"2007-01-27T00:00:00Z","timestamp":1169856000000},"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":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2007,8]]},"DOI":"10.1007\/s10618-006-0059-1","type":"journal-article","created":{"date-parts":[[2007,1,26]],"date-time":"2007-01-26T15:37:53Z","timestamp":1169825873000},"page":"55-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":982,"title":["Frequent pattern mining: current status and future directions"],"prefix":"10.1007","volume":"15","author":[{"given":"Jiawei","family":"Han","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hong","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dong","family":"Xin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xifeng","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,1,27]]},"reference":[{"key":"59_CR1","doi-asserted-by":"crossref","unstructured":"Afrati FN, Gionis A, Mannila H (2004) Approximating a collection of frequent sets. In: Proceedings of the 2004 ACM SIGKDD international conference knowledge discovery in databases (KDD\u201904), Seattle, WA, pp 12\u201319","DOI":"10.1145\/1014052.1014057"},{"key":"59_CR2","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"R Agarwal","year":"2001","unstructured":"Agarwal R, Aggarwal CC, Prasad VVV (2001) A tree projection algorithm for generation of frequent itemsets. J Parallel Distribut Comput 61:350\u2013371","journal-title":"J Parallel Distribut Comput"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Yu PS (1998) A new framework for itemset generation. In: Proceedings of the 1998 ACM symposium on principles of database systems (PODS\u201998), Seattle, WA, pp 18\u201324","DOI":"10.1145\/275487.275490"},{"key":"59_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal R, Gehrke J, Gunopulos D, Raghavan P (1998) Automatic subspace clustering of high dimensional data for data mining applications. In: Proceedings of the 1998 ACM-SIGMOD international conference on management of data (SIGMOD\u201998), Seattle, WA, pp 94\u2013105","DOI":"10.1145\/276304.276314"},{"key":"59_CR5","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM-SIGMOD international conference on management of data (SIGMOD\u201993), Washington, DC, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"key":"59_CR6","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal R, Shafer JC (1996) Parallel mining of association rules: design, implementation, and experience. IEEE Trans Knowl Data Eng 8:962\u2013969","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"59_CR7","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 1994 international conference on very large data bases (VLDB\u201994), Santiago, Chile, pp 487\u2013499"},{"key":"59_CR8","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceedings of the 1995 international conference on data engineering (ICDE\u201995), Taipei, Taiwan, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"59_CR9","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/846183.846185","volume":"1","author":"KM Ahmed","year":"2000","unstructured":"Ahmed KM, El-Makky NM, Taha Y (2000) A note on \u201cbeyond market basket: generalizing association rules to correlations\u201d. SIGKDD Explorations 1:46\u201348","journal-title":"SIGKDD Explorations"},{"key":"59_CR10","doi-asserted-by":"crossref","unstructured":"Asai T, Abe K, Kawasoe S, Arimura H, Satamoto H, Arikawa S (2002) Efficient substructure discovery from large semi-structured data. In: Proceedings of the 2002 SIAM international conference on data mining (SDM\u201902), Arlington, VA, pp 158\u2013174","DOI":"10.1137\/1.9781611972726.10"},{"key":"59_CR11","doi-asserted-by":"crossref","unstructured":"Aumann Y, Lindell Y (1999) A statistical theory for quantitative association rules. In: Proceeding of the 1999 international conference on knowledge discovery and data mining (KDD\u201999), San Diego, CA, pp 261\u2013270","DOI":"10.1145\/312129.312243"},{"key":"59_CR12","doi-asserted-by":"crossref","unstructured":"Bayardo RJ (1998) Efficiently mining long patterns from databases. In: Proceeding of the 1998 ACM-SIGMOD international conference on management of data (SIGMOD\u201998), Seattle, WA, pp 85\u201393","DOI":"10.1145\/276304.276313"},{"key":"59_CR13","doi-asserted-by":"crossref","unstructured":"Beil F, Ester M, Xu X (2002) Frequent term-based text clustering. In: Proceeding of the 2002 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201902), Edmonton, Canada, pp 436\u2013442","DOI":"10.1145\/775107.775110"},{"key":"59_CR14","first-page":"32","volume":"21","author":"C Bettini","year":"1998","unstructured":"Bettini C, Sean Wang X, Jajodia S (1998) Mining temporal relationships with multiple granularities in time sequences. Bull Tech Committee Data Eng 21:32\u201338","journal-title":"Bull Tech Committee Data Eng"},{"key":"59_CR15","doi-asserted-by":"crossref","unstructured":"Beyer K, Ramakrishnan R (1999) Bottom-up computation of sparse and iceberg cubes. In: Proceeding of the 1999 ACM-SIGMOD international conference on management of data (SIGMOD\u201999), Philadelphia, PA, pp 359\u2013370","DOI":"10.1145\/304182.304214"},{"key":"59_CR16","doi-asserted-by":"crossref","unstructured":"Blanchard J, Guillet F, Gras R, Briand H (2005) Using information-theoretic measures to assess association rule interestingness. In: Proceeding of the 2005 international conference on data mining (ICDM\u201905), Houston, TX, pp 66\u201373","DOI":"10.1109\/ICDM.2005.149"},{"key":"59_CR17","doi-asserted-by":"crossref","unstructured":"Bonchi F, Giannotti F, Mazzanti A, Pedreschi D (2003) Exante: anticipated data reduction in constrained pattern mining. In: Proceeding of the 7th European conference on principles and pratice of knowledge discovery in databases (PKDD\u201903), pp 59\u201370","DOI":"10.1007\/978-3-540-39804-2_8"},{"key":"59_CR18","doi-asserted-by":"crossref","unstructured":"Bonchi F, Lucchese C (2004) On closed constrained frequent pattern mining. In: Proceeding of the 2004 international conference on data mining (ICDM\u201904), Brighton, UK, pp 35\u201342","DOI":"10.1109\/ICDM.2004.10093"},{"key":"59_CR19","doi-asserted-by":"crossref","unstructured":"Borgelt C, Berthold MR (2002) Mining molecular fragments: finding relevant substructures of molecules. In: Proceeding of the 2002 international conference on data mining (ICDM\u201902), Maebashi, Japan, pp 211\u2013218","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"59_CR20","doi-asserted-by":"crossref","unstructured":"Brin S, Motwani R, Silverstein C (1997) Beyond market basket: generalizing association rules to correlations. In: Proceeding of the 1997 ACM-SIGMOD international conference on management of data (SIGMOD\u201997), Tucson, AZ, pp 265\u2013276","DOI":"10.1145\/253260.253327"},{"key":"59_CR21","doi-asserted-by":"crossref","unstructured":"Brin S, Motwani R, Ullman JD, Tsur S (1997) Dynamic itemset counting and implication rules for market basket analysis. In: Proceeding of the 1997 ACM-SIGMOD international conference on management of data (SIGMOD\u201997), Tucson, AZ, pp 255\u2013264","DOI":"10.1145\/253260.253325"},{"key":"59_CR22","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1024076020895","volume":"7","author":"C Bucila","year":"2003","unstructured":"Bucila C, Gehrke J, Kifer D, White W (2003) DualMiner: a dual-pruning algorithm for itemsets with constraints. Data Min knowl discov 7:241\u2013272","journal-title":"Data Min knowl discov"},{"key":"59_CR23","doi-asserted-by":"crossref","unstructured":"Burdick D, Calimlim M, Gehrke J (2001) MAFIA: a maximal frequent itemset\u00a0algorithm for transactional databases. In: Proceeding of the 2001 international conference on data engineering (ICDE\u201901), Heidelberg, Germany, pp 443\u2013452","DOI":"10.1109\/ICDE.2001.914857"},{"key":"59_CR24","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2002) Mining all non-derivable frequent itemsets. In: Proceeding of the 2002 European conference on principles and pratice of knowledge discovery in databases (PKDD\u201902), Helsinki, Finland, pp 74\u201385","DOI":"10.1007\/3-540-45681-3_7"},{"key":"59_CR25","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2005) Depth-first non-derivable itemset mining. In: Proceeding of the 2005 SIAM international conference on data mining (SDM\u201905), Newport Beach, CA, pp 250\u2013261","DOI":"10.1137\/1.9781611972757.23"},{"key":"59_CR26","unstructured":"Cao H, Mamoulis N, Cheung DW (2005) Mining frequent spatio-temporal sequential patterns. In: Proceeding of the 2005 international conference on data mining (ICDM\u201905), Houston, TX, pp 82\u201389"},{"key":"59_CR27","doi-asserted-by":"crossref","unstructured":"Chang J, Lee W (2003) Finding recent frequent itemsets adaptively over online data streams. In: Proceeding of the 2003 international conference on knowledge discovery and data mining (KDD\u201903), Washington, DC, pp 487\u2013492","DOI":"10.1145\/956804.956807"},{"key":"59_CR28","unstructured":"Chen MS, Park JS, Yu PS (1996) Data mining for path traversal patterns in a web environment. In: Proceeding of the 16th international conference on distributed computing systems, pp 385\u2013392"},{"key":"59_CR29","doi-asserted-by":"crossref","unstructured":"Cheng CH, Fu AW, Zhang Y (1999) Entropy-based subspace clustering for mining numerical data. In: Proceeding of the 1999 international conference on knowledge discovery and data mining (KDD\u201999), San Diego, CA, pp 84\u201393","DOI":"10.1145\/312129.312199"},{"key":"59_CR30","doi-asserted-by":"crossref","unstructured":"Cheng H, Yan X, Han J (2004) IncSpan: incremental mining of sequential patterns in large In: Proceeding of the 2004 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201904), Seattle, WA, pp 527\u2013532","DOI":"10.1145\/1014052.1014114"},{"key":"59_CR31","doi-asserted-by":"crossref","unstructured":"Cheng H, Yan X, Han J (2005) Seqindex: indexing sequences by sequential pattern analysis. In: Proceeding of the 2005 SIAM international conference on data mining (SDM\u201905), Newport Beach, CA, pp 601\u2013605","DOI":"10.1137\/1.9781611972757.69"},{"key":"59_CR32","doi-asserted-by":"crossref","unstructured":"Cheng H, Yan X, Han J, Hsu C (2007) Discriminative frequent pattern analysis for effective classification. In: Proceeding of the 2007 international conference on data engineering (ICDE\u201907), Istanbul, Turkey","DOI":"10.1109\/ICDE.2007.367917"},{"key":"59_CR33","doi-asserted-by":"crossref","unstructured":"Cheung DW, Han J, Ng V, Fu A, Fu Y (1996) A fast distributed algorithm for mining association rules. In: Proceeding of the 1996 international conference on parallel and distributed information systems, Miami Beach, FL, pp 31\u201344","DOI":"10.1109\/PDIS.1996.568665"},{"key":"59_CR34","doi-asserted-by":"crossref","unstructured":"Cheung DW, Han J, Ng V, Wong CY (1996) Maintenance of discovered association rules in large an incremental updating technique. In: Proceeding of the 1996 international conference on data engineering (ICDE\u201996), New Orleans, LA, pp 106\u2013114","DOI":"10.1109\/ICDE.1996.492094"},{"key":"59_CR35","unstructured":"Chi Y, Wang H, Yu PS, Muntz R (2004) Moment: maintaining closed frequent itemsets over a stream sliding window. In: Proceeding of the 2004 international conference on data mining (ICDM\u201904), Brighton, UK, pp 59\u201366"},{"key":"59_CR36","doi-asserted-by":"crossref","unstructured":"Cong S, Han J, Padua D (2005) Parallel mining of closed sequential patterns. In: Proceeding of the 2005 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201905), Chicago, IL, pp 562\u2013567","DOI":"10.1145\/1081870.1081937"},{"key":"59_CR37","doi-asserted-by":"crossref","unstructured":"Cong G, Tan K-L, Tung AKH, Xu X (2005) Mining top-k covering rule groups for gene expression data. In: Proceeding of the 2005 ACM-SIGMOD international conference on management of data (SIGMOD\u201905), Baltimore, MD, pp 670\u2013681","DOI":"10.1145\/1066157.1066234"},{"key":"59_CR38","doi-asserted-by":"crossref","unstructured":"Deshpande M, Kuramochi M, Karypis G (2003) Frequent sub-structure-based approaches for classifying chemical compounds. In: Proceeding of the 2002 international conference on data mining (ICDM\u201903), Melbourne, FL, pp 35\u201342","DOI":"10.21236\/ADA439580"},{"key":"59_CR39","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/TKDE.2004.28","volume":"16","author":"G Dong","year":"2004","unstructured":"Dong G, Han J, Lam J, Pei J, Wang K, Zou W (2004) Mining constrained gradients in multi-dimensional databases. IEEE Trans Knowl Data Eng 16:922\u2013938","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"59_CR40","unstructured":"Dehaspe L, Toivonen H, King R (1998) Finding frequent substructures in chemical compounds. In: Proceeding of the 1998 international conference on knowledge discovery and data mining (KDD\u201998), New York, NY, pp 30\u201336"},{"key":"59_CR41","doi-asserted-by":"crossref","unstructured":"Dong G, Li J (1999) Efficient mining of emerging patterns: discovering trends and differences. In: Proceeding of the 1999 international conference on knowledge discovery and data mining (KDD\u201999), San Diego, CA, pp 43\u201352","DOI":"10.1145\/312129.312191"},{"key":"59_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/643477.643478","volume":"3","author":"M Eirinaki","year":"2003","unstructured":"Eirinaki M, Vazirgiannis M (2003) Web mining for web personalization. ACM Trans Inter Tech 3:1\u201327","journal-title":"ACM Trans Inter Tech"},{"key":"59_CR43","doi-asserted-by":"crossref","unstructured":"Fukuda T, Morimoto Y, Morishita S, Tokuyama T (1996) Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization. In: Proceeding of the 1996 ACM-SIGMOD international conference management of data (SIGMOD\u201996), Montreal, Canada, pp 13\u201323","DOI":"10.1145\/233269.233313"},{"key":"59_CR44","doi-asserted-by":"crossref","unstructured":"Gade K, Wang J, Karypis G (2004) Efficient closed pattern mining in the presence of tough block constraints. In: Proceeding of the 2004 international conference on knowledge discovery and data mining (KDD\u201904), Seattle, WA, pp 138\u2013147","DOI":"10.1145\/1014052.1014070"},{"key":"59_CR45","unstructured":"Garofalakis M, Rastogi R, Shim K (1999) SPIRIT: Sequential pattern mining with regular expression constraints. In: Proceeding of the 1999 international conference on Very large data bases (VLDB\u201999), Edinburgh, UK, pp 223\u2013234"},{"key":"59_CR46","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Bussche J (2001) A tight upper bound on the number of candidate patterns. In: Proceeding of the 2001 international conference on data mining (ICDM\u201901), San Jose, CA, pp 155\u2013162","DOI":"10.1109\/ICDM.2001.989513"},{"key":"59_CR47","doi-asserted-by":"crossref","unstructured":"Gionis A, Kujala T, Mannila H (2003) Fragments of order. In: Proceeding of the 2003 international conference on knowledge discovery and data mining (KDD\u201903), Washington, DC, pp 129\u2013136","DOI":"10.1145\/956755.956768"},{"key":"59_CR48","doi-asserted-by":"crossref","unstructured":"Gionis A, Mannila H, Mielik\u00e4inen T, Tsaparas P (2006) Assessing data mining results via swap randomization. In: Proceeding of the 2006 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201906), Philadelphia, PA, pp 167\u2013176","DOI":"10.1145\/1150402.1150424"},{"key":"59_CR49","doi-asserted-by":"crossref","unstructured":"Goethals B, Zaki M (2003) An introduction to workshop on frequent itemset mining implementations. In: Proceeding of the ICDM\u201903 international workshop on frequent itemset mining implementations (FIMI\u201903), Melbourne, FL, pp 1\u201313","DOI":"10.1145\/1007730.1007744"},{"key":"59_CR50","doi-asserted-by":"crossref","unstructured":"Grahne G, Lakshmanan L, Wang X (2000) Efficient mining of constrained correlated sets. In: Proceeding of the 2000 international conference on data engineering (ICDE\u201900), San Diego, CA, pp 512\u2013521","DOI":"10.1109\/ICDE.2000.839450"},{"key":"59_CR51","unstructured":"Grahne G, Zhu J (2003)Efficiently using prefix-trees in mining frequent itemsets. In: Proceeding of the ICDM\u201903 international workshop on frequent itemset mining implementations (FIMI\u201903), Melbourne, FL, pp 123\u2013132"},{"key":"59_CR52","unstructured":"Han J, Dong G, Yin Y (1999) Efficient mining of partial periodic patterns in time series database. In: Proceeding of the 1999 international conference on data engineering (ICDE\u201999), Sydney, Australia, pp 106\u2013115"},{"key":"59_CR53","unstructured":"Han J, Fu Y (1995) Discovery of multiple-level association rules from large databases. In: Proceeding of the 1995 international conference on very large data bases (VLDB\u201995), Zurich, Switzerland, pp 420\u2013431"},{"key":"59_CR54","unstructured":"Han J, Kamber M (2006) Data mining: concepts and techniques, 2nd edn. Morgan Kaufmann"},{"key":"59_CR55","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Dong G, Wang K (2001) Efficient computation of iceberg cubes with complex measures. In: Proceeding of the 2001 ACM-SIGMOD international conference on management of data (SIGMOD\u201901), Santa Barbara, CA, pp 1\u201312","DOI":"10.1145\/375663.375664"},{"key":"59_CR56","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceeding of the 2000 ACM-SIGMOD international conference on management of data (SIGMOD\u201900), Dallas, TX, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"59_CR57","doi-asserted-by":"crossref","unstructured":"Hilderman RJ, Hamilton HJ (2001) Knowledge discovery and measures of interest. Kluwer Academic","DOI":"10.1007\/978-1-4757-3283-2"},{"key":"59_CR58","unstructured":"Holder LB, Cook DJ, Djoko S (1994) Substructure discovery in the subdue system. In: Proceeding of the AAAI\u201994 workshop knowledge discovery in databases (KDD\u201994), Seattle, WA, pp 169\u2013180"},{"key":"59_CR59","unstructured":"Holsheimer M, Kersten M, Mannila H, Toivonen H (1995) A perspective on databases and data mining. In Proceeding of the 1995 international conference on knowledge discovery and data mining (KDD\u201995), Montreal, Canada, pp 150\u2013155"},{"key":"59_CR60","unstructured":"Huan J, Wang W, Bandyopadhyay D, Snoeyink J, Prins J, Tropsha A (2004) Mining spatial motifs from protein structure graphs. In: Proceeding of the 8th international conference on research in computational molecular biology (RECOMB), San Diego, CA, pp 308\u2013315"},{"key":"59_CR61","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J (2003) Efficient mining of frequent subgraph in the presence of isomorphism. In: Proceeding of the 2003 international conference on data mining (ICDM\u201903), Melbourne, FL, pp 549\u2013552","DOI":"10.1109\/ICDM.2003.1250974"},{"key":"59_CR62","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J, Yang J (2004) Spin: mining maximal frequent subgraphs from graph databases. In: Proceeding of the 2004 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201904), Seattle, WA, pp 581\u2013586","DOI":"10.1145\/1014052.1014123"},{"key":"59_CR63","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1015417610840","volume":"6","author":"T Imielinski","year":"2002","unstructured":"Imielinski T, Khachiyan L, Abdulghani A (2002) Cubegrades: generalizing association rules. Data Min Knowl Discov 6:219\u2013258","journal-title":"Data Min Knowl Discov"},{"key":"59_CR64","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: Proceeding of the 2000 European symposium on the principle of data mining and knowledge discovery (PKDD\u201900), Lyon, France, pp 13\u201323","DOI":"10.1007\/3-540-45372-5_2"},{"key":"59_CR65","doi-asserted-by":"crossref","unstructured":"Jaroszewicz S, Scheffer T (2005) Fast discovery of unexpected patterns in data relative to a bayesian network. In: Proceeding of the 2005 ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201905), Chicago, IL, pp 118\u2013127","DOI":"10.1145\/1081870.1081887"},{"key":"59_CR66","doi-asserted-by":"crossref","unstructured":"Jaroszewicz S, Simovici D (2004) interestingness of frequent itemsets using bayesian networks as background knowledge. In: Proceeding of the 2004 ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201904), Seattle, WA, pp 178\u2013186","DOI":"10.1145\/1014052.1014074"},{"key":"59_CR67","unstructured":"Ji X, Bailey J, Dong G (2005) Mining minimal distinguishing subsequence patterns with gap constraints. In: Proceeding of the 2005 international conference on data mining (ICDM\u201905), Houston, TX, pp 194\u2013201"},{"key":"59_CR68","unstructured":"Jin R, Agrawal G (2005) An algorithm for in-core frequent itemset mining on streaming data. In Proceeding of the 2005 international conference on data mining (ICDM\u201905), Houston, TX, pp 210\u2013217"},{"key":"59_CR69","doi-asserted-by":"crossref","unstructured":"Jin R, Wang C, Polshakov D, Parthasarathy S, Agrawal G (2005) Discovering frequent topological structures from graph datasets. In: Proceeding of the 2005 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201905), Chicago, IL, pp 606\u2013611","DOI":"10.1145\/1081870.1081944"},{"key":"59_CR70","unstructured":"Kamber M, Han J, Chiang JY (1997) Metarule-guided mining of multi-dimensional association rules using data cubes. In: Proceeding of the 1997 international conference on knowledge discovery and data mining (KDD\u201997), Newport Beach, CA, pp 207\u2013210"},{"key":"59_CR71","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"RM Karp","year":"2003","unstructured":"Karp RM, Papadimitriou CH, Shenker S (2003) A simple algorithm for finding frequent elements in streams and bags. ACM Trans Database Syst, 28:51\u201355","journal-title":"ACM Trans Database Syst,"},{"key":"59_CR72","doi-asserted-by":"crossref","unstructured":"Koperski K, Han J (1995) Discovery of spatial association rules in geographic information databases. In: Proceeding of the 1995 international symposium on large spatial databases (SSD\u201995), Portland, ME, pp 47\u201366","DOI":"10.1007\/3-540-60159-7_4"},{"key":"59_CR73","doi-asserted-by":"crossref","unstructured":"Kosala R, Blockeel H (2000) Web mining research: a survey. SIGKDD Explor 2","DOI":"10.1145\/360402.360406"},{"key":"59_CR74","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceeding of the 2001 international conference on data mining (ICDM\u201901), San Jose, CA, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"key":"59_CR75","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2004) GREW: a scalable frequent subgraph discovery algorithm. In Proceeding of the 2004 international conference on data mining (ICDM\u201904), Brighton, UK, pp 439\u2013442","DOI":"10.21236\/ADA439436"},{"key":"59_CR76","doi-asserted-by":"crossref","unstructured":"Lakshmanan LVS, Ng R, Han J, Pang A (1999) Optimization of constrained frequent set queries with 2-variable constraints. In: Proceeding of the 1999 ACM-SIGMOD international conference on management of data (SIGMOD\u201999), Philadelphia, PA, pp 157\u2013168","DOI":"10.1145\/304182.304196"},{"key":"59_CR77","doi-asserted-by":"crossref","unstructured":"Lakshmanan LVS, Pei J, Han J (2002) Quotient cube: how to summarize the semantics of a data cube. In: Proceeding of the 2002 international conference on very large data bases (VLDB\u201902), Hong Kong, China, pp 778\u2013789","DOI":"10.1016\/B978-155860869-6\/50074-3"},{"key":"59_CR78","unstructured":"Lee Y-K, Kim W-Y, Cai YD, Han J (2003) CoMine: efficient mining of correlated patterns. In: Proceeding of the 2003 international conference on data mining (ICDM\u201903), Melbourne, FL, pp 581\u2013584"},{"key":"59_CR79","doi-asserted-by":"crossref","unstructured":"Lent B, Swami A, Widom J (1997) Clustering association rules. In: Proceeding of the 1997 international conference on data engineering (ICDE\u201997), Birmingham, England, pp 220\u2013231","DOI":"10.1109\/ICDE.1997.581756"},{"key":"59_CR80","unstructured":"Li Z, Chen Z, Srinivasan SM, Zhou Y (2004) C-Miner: mining block correlations in storage systems. In: Proceeding of the 2004 USENIX conference on file and storage technologies (FAST\u201904), San Francisco, CA, pp 173\u2013186"},{"key":"59_CR81","doi-asserted-by":"crossref","unstructured":"Li J, Dong G, Ramamohanrarao K (2000) Making use of the most expressive jumping emerging patterns for classification. In: Proceeding of the 2000 Pacific-Asia conference on knowledge discovery and data mining (PAKDD\u201900), Kyoto, Japan, pp 220\u2013232","DOI":"10.1007\/3-540-45571-X_29"},{"key":"59_CR82","doi-asserted-by":"crossref","unstructured":"Li X, Han J, Kim S (2006) Motion-alert: automatic anomaly detection in massive moving objects. In: IEEE international conference on intelligence and security informatics (ISI\u201906), San Diego, CA, pp 166\u2013177","DOI":"10.1007\/11760146_15"},{"key":"59_CR83","unstructured":"Li W, Han J, Pei J (2001) CMAR: accurate and efficient classification based on multiple class-association rules. In: Proceeding of the 2001 international conference on data mining (ICDM\u201901), San Jose, CA, pp 369\u2013376"},{"key":"59_CR84","unstructured":"Li Z, Lu S, Myagmar S, Zhou Y (2004) CP-Miner: a tool for finding copy-paste and related bugs in operating system code. In: Proceeding of the 2004 symposium on operating systems design and implementation (OSDI\u201904), San Francisco, CA, pp 289\u2013302"},{"key":"59_CR85","doi-asserted-by":"crossref","unstructured":"Li Z, Zhou Y (2005) PR-Miner: Automatically extracting implicit programming rules and detecting violations in large software code. In: Proceeding of the 2005 ACM SIGSOFT symposium on foundations software eng (FSE\u201905), Lisbon, Portugal, pp 306\u2013315","DOI":"10.1145\/1095430.1081755"},{"key":"59_CR86","doi-asserted-by":"crossref","unstructured":"Lin C, Chiu D, Wu Y, Chen A (2005) Mining frequent itemsets from data streams with a time-sensitive sliding window. In: Proceeding of the 2005 SIAM international conference on data mining (SDM\u201905), Newport Beach, pp 68\u201379","DOI":"10.1137\/1.9781611972757.7"},{"key":"59_CR87","doi-asserted-by":"crossref","unstructured":"Liu H, Han J, Xin D, Shao Z (2006) Mining frequent patterns on very high dimensional data: a top-down row enumeration approach. In: Proceeding of the 2006 SIAM international conference on data mining (SDM\u201906), Bethesda, MD, pp 280\u2013291","DOI":"10.1137\/1.9781611972764.25"},{"key":"59_CR88","unstructured":"Liu B, Hsu W, Ma Y (1998) Integrating classification and association rule mining. In: Proceeding of the 1998 international conference on knowledge discovery and data mining (KDD\u201998), New York, NY, pp 80\u201386"},{"key":"59_CR89","doi-asserted-by":"crossref","unstructured":"Liu G, Li J, Wong L, Hsu W (2006) Positive borders or negative borders: how to make lossless generator based representations concise. In: Proceeding of the 2006 SIAM international conference on data mining (SDM\u201906), Bethesda, MD, pp 467\u2013471","DOI":"10.1137\/1.9781611972764.42"},{"key":"59_CR90","doi-asserted-by":"crossref","unstructured":"Liu G, Lu H, Lou W, Yu JX (2003) On computing, storing and querying frequent patterns. In: Proceeding of the 2003 ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201903), Washington, DC, pp 607\u2013612","DOI":"10.1145\/956804.956827"},{"key":"59_CR91","doi-asserted-by":"crossref","unstructured":"Liu J, Paulsen S, Sun X, Wang W, Nobel A, Prins J (2006) Mining approximate frequent itemsets in the presence of noise: algorithm and analysis. In: Proceeding of the 2006 SIAM international conference on data mining (SDM\u201906), Bethesda, MD, pp 405\u2013416","DOI":"10.1137\/1.9781611972764.36"},{"key":"59_CR92","doi-asserted-by":"crossref","unstructured":"Liu J, Pan Y, Wang K, Han J (2002) Mining frequent item sets by opportunistic projection. In: Proceeding of the 2002 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201902), Edmonton, Canada, pp 239\u2013248","DOI":"10.1145\/775079.775081"},{"key":"59_CR93","doi-asserted-by":"crossref","unstructured":"Liu C, Yan X, Yu H, Han J, Yu PS (2005) Mining behavior graphs for \u201cbacktrace\u201d of noncrashing bugs. In: Proceeding of the 2005 SIAM international conference on data mining (SDM\u201905), Newport Beach, pp 286\u2013297","DOI":"10.1137\/1.9781611972757.26"},{"key":"59_CR94","unstructured":"Lu H, Han J, Feng L (1998) Stock movement and n-dimensional inter-transaction association rules. In: Proceeding of the 1998 SIGMOD workshop research issues on data mining and knowledge discovery (DMKD\u201998), Seattle, WA, pp 12:1\u201312:7"},{"key":"59_CR95","doi-asserted-by":"crossref","unstructured":"Luo C, Chung S (2005) Efficient mining of maximal sequential patterns using multiple samples. In: Proceeding of the 2005 SIAM international conference on data mining (SDM\u201905), Newport Beach, CA, pp 415\u2013426","DOI":"10.1137\/1.9781611972757.37"},{"key":"59_CR96","unstructured":"Ma S, Hellerstein JL (2001) Mining partially periodic event patterns with unknown periods. In: Proceeding of the 2001 international conference on data engineering (ICDE\u201901), Heidelberg, Germany, pp 205\u2013214"},{"key":"59_CR97","doi-asserted-by":"crossref","unstructured":"Manku G, Motwani R (2002) Approximate frequency counts over data streams. In: Proceeding of the 2002 international conference on very large data bases (VLDB\u201902), Hong Kong, China, pp 346\u2013357","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"59_CR98","unstructured":"Mannila H, Toivonen H, Verkamo AI (1994) Efficient algorithms for discovering association rules. In: Proceeding of the AAAI\u201994 workshop knowledge discovery in databases (KDD\u201994), Seattle, WA, pp 181\u2013192"},{"key":"59_CR99","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H, Verkamo AI (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Discov 1:259\u2013289","journal-title":"Data Min Knowl Discov"},{"key":"59_CR100","doi-asserted-by":"crossref","unstructured":"Mei Q, Xin D, Cheng H, Han J, Zhai C (2006) Generating semantic annotations for frequent patterns with context analysis. In: Proceeding of the 2006 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201906), Philadelphia, PA, pp 337\u2013346","DOI":"10.1145\/1150402.1150441"},{"key":"59_CR101","doi-asserted-by":"crossref","unstructured":"Metwally A, Agrawal D, El Abbadi A (2005) Efficient computation of frequent and top-k elements in data streams. In: Proceeding of the 2005 international conference on database theory (ICDT\u201905), Edinburgh, UK, pp 398\u2013412","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"59_CR102","doi-asserted-by":"crossref","unstructured":"Miller RJ, Yang Y (1997) Association rules over interval data. In: Proceeding of the 1997 ACM-SIGMOD international conference on management of data (SIGMOD\u201997), Tucson, AZ, pp 452\u2013461","DOI":"10.1145\/253260.253361"},{"key":"59_CR103","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0169-023X(01)00008-8","volume":"37","author":"A Nanopoulos","year":"2001","unstructured":"Nanopoulos A, Manolopoulos Y (2001) Mining patterns from graph traversals. Data Knowl Eng 37:243\u2013266","journal-title":"Data Knowl Eng"},{"key":"59_CR104","doi-asserted-by":"crossref","unstructured":"Ng R, Lakshmanan LVS, Han J, Pang A (1998) Exploratory mining and pruning optimizations of constrained associations rules. In: Proceeding of the 1998 ACM-SIGMOD international conference on management of data (SIGMOD\u201998), Seattle, WA, pp 13\u201324","DOI":"10.1145\/276304.276307"},{"key":"59_CR105","doi-asserted-by":"crossref","unstructured":"Nijssen S, Kok J (2004) A quickstart in frequent structure mining can make a difference. In: Proceeding of the 2004 ACM SIGKDD international conference on kowledge discovery in databases (KDD\u201904), Seattle, WA, pp 647\u2013652","DOI":"10.1145\/1014052.1014134"},{"key":"59_CR106","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TKDE.2003.1161582","volume":"15","author":"E Omiecinski","year":"2003","unstructured":"Omiecinski E (2003) Alternative interest measures for mining associations. IEEE Trans Knowl and data engineering 15:57\u201369","journal-title":"IEEE Trans Knowl and data engineering"},{"key":"59_CR107","unstructured":"\u00d6zden B, Ramaswamy S, Silberschatz A (1998) Cyclic association rules. In: Proceeding of the 1998 international conference on data engineering (ICDE\u201998), Orlando, FL, pp 412\u2013421"},{"key":"59_CR108","doi-asserted-by":"crossref","unstructured":"Pan F, Cong G, Tung AKH, Yang J, Zaki M (2003) CARPENTER: finding closed patterns in long biological datasets. In: Proceeding of the 2003 ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201903), Washington, DC, pp 637\u2013642","DOI":"10.1145\/956804.956832"},{"key":"59_CR109","unstructured":"Pan F, Tung AKH, Cong G, Xu X (2004) COBBLER: combining column, and row enumeration for closed pattern discovery. In: Proceeding of the 2004 international conference on scientific and statistical database management (SSDBM\u201904), Santorini Island, Greece, pp 21\u201330"},{"key":"59_CR110","doi-asserted-by":"crossref","unstructured":"Park JS, Chen MS, Yu PS (1995) An effective hash-based algorithm for mining association rules. In: Proceeding of the 1995 ACM-SIGMOD international conference on management of data (SIGMOD\u201995), San Jose, CA, pp 175\u2013186","DOI":"10.1145\/223784.223813"},{"key":"59_CR111","doi-asserted-by":"crossref","unstructured":"Park JS, Chen MS, Yu PS (1995) Efficient parallel mining for association rules. In: Proceeding of the 4th international conference on information and knowledge management, Baltimore, MD, pp 31\u201336","DOI":"10.1145\/221270.221320"},{"key":"59_CR112","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proceeding of the 7th international conference on database theory (ICDT\u201999), Jerusalem, Israel, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"59_CR113","unstructured":"Pei J, Dong G, Zou W, Han J (2002) On computing condensed frequent pattern bases. In: Proceeding of the 2002 international conference on data mining (ICDM\u201902), Maebashi, Japan, pp 378\u2013385"},{"key":"59_CR114","unstructured":"Pei J, Han J, Lakshmanan LVS (2001) Mining frequent itemsets with convertible constraints. In: Proceeding of the 2001 international conference on data engineering (ICDE\u201901), Heidelberg, Germany, pp 433\u2013332"},{"key":"59_CR115","unstructured":"Pei J, Han J, Mao R (2000) CLOSET: an efficient algorithm for mining frequent closed itemsets. In: Proceeding of the 2000 ACM-SIGMOD international workshop data mining and knowledge discovery (DMKD\u201900), Dallas, TX, pp 11\u201320"},{"key":"59_CR116","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: Proceeding of the 2001 international conference on data engineering (ICDE\u201901), Heidelberg, Germany, pp 215\u2013224"},{"key":"59_CR117","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J Pei","year":"2004","unstructured":"Pei J, Han J, Mortazavi-Asl B, Wang J, Pinto H, Chen Q, Dayal U, Hsu M-C (2004) Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans Knowl Data Eng 16:1424\u20131440","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"59_CR118","doi-asserted-by":"crossref","unstructured":"Pei J, Han J, Mortazavi-Asl B, Zhu H (2000) Mining access patterns efficiently from web logs. In: Proceeding of the 2000 Pacific-Asia conference on knowledge discovery and data mining (PAKDD\u201900), Kyoto, Japan, pp 396\u2013407","DOI":"10.1007\/3-540-45571-X_47"},{"key":"59_CR119","doi-asserted-by":"crossref","unstructured":"Pei J, Han J, Wang W (2002) Constraint-based sequential pattern mining in large databases. In: Proceeding of the 2002 international conference on information and knowledge management (CIKM\u201902), McLean, VA, pp 18\u201325","DOI":"10.1145\/584796.584799"},{"key":"59_CR120","unstructured":"Pei J, Liu J, Wang H, Wang K, Yu PS, Yang J (2005) Efficiently mining frequent closed partial orders. In: Proceeding of the 2005 international conference on data mining (ICDM\u201905), Houston, TX, pp 753\u2013756"},{"key":"59_CR121","unstructured":"Piatetsky-Shapiro G (1991) Notes of AAAI\u201991 workshop knowledge discovery in databases (KDD\u201991). AAAI\/MIT Press, Anaheim, CA"},{"key":"59_CR122","doi-asserted-by":"crossref","unstructured":"Pinto H, Han J, Pei J, Wang K, Chen Q, Dayal U (2001) Multi-dimensional sequential pattern mining. In: Proceeding of the 2001 international conference on information and knowledge management (CIKM\u201901), Atlanta, GA, pp 81\u201388","DOI":"10.1145\/502598.502600"},{"key":"59_CR123","unstructured":"Punin J, Krishnamoorthy M, Zaki M (2001) Web usage mining: languages and algorithms. Springer-Verlag"},{"key":"59_CR124","doi-asserted-by":"crossref","unstructured":"Ramesh G, Maniatty WA, Zaki MJ (2003) Feasible itemset distributions in data mining: theory and application. In: Proceeding of the 2003 ACM symposium on principles of database systems (PODS\u201903), San Diego, CA, pp 284\u2013295","DOI":"10.1145\/773153.773181"},{"key":"59_CR125","doi-asserted-by":"crossref","unstructured":"Sarawagi S, Thomas S, Agrawal R (1998) Integrating association rule mining with relational database systems: alternatives and implications. In: Proceeding of the 1998 ACM-SIGMOD international conference on management of data (SIGMOD\u201998), Seattle, WA, pp 343\u2013354","DOI":"10.1145\/276304.276335"},{"key":"59_CR126","unstructured":"Savasere A, Omiecinski E, Navathe S (1995) An efficient algorithm for mining association rules in large databases. In: Proceeding of the 1995 international conference on very large data bases (VLDB\u201995), Zurich, Switzerland, pp 432\u2013443"},{"key":"59_CR127","doi-asserted-by":"crossref","unstructured":"Sepp\u00e4nen J, Mannila H (2004) Dense itemsets. In: Proceeding of the 2004 international conference on knowledge discovery and data mining (KDD\u201904), Seattle, WA, pp 683\u2013688","DOI":"10.1145\/1014052.1014140"},{"key":"59_CR128","unstructured":"Shekar B, Natarajan R (2004) A transaction-based neighbourhood-driven approach to quantifying interestingness of assoication rules. In: Proceeding of the 2004 international conference on data mining (ICDM\u201904), Brighton, UK, pp 194\u2013201"},{"key":"59_CR129","doi-asserted-by":"crossref","unstructured":"Siebes A, Vreeken J, Leeuwen M (2006) Item sets that compress. In: Proceeding of the 2006 SIAM international conference on data mining (SDM\u201906), Bethesda, MD, pp 393\u2013404","DOI":"10.1137\/1.9781611972764.35"},{"key":"59_CR130","unstructured":"Silverstein C, Brin S, Motwani R, Ullman JD (1998) Scalable techniques for mining causal structures. In: Proceeding of the 1998 international conference on very large data bases (VLDB\u201998), New York, NY, pp 594\u2013605"},{"key":"59_CR131","doi-asserted-by":"crossref","unstructured":"Sismanis Y, Roussopoulos N, Deligianannakis A, Kotidis Y (2002) Dwarf: shrinking the petacube. In: Proceeding of the 2002 ACM-SIGMOD international conference on management of data (SIGMOD\u201902), Madison, WI, pp 464\u2013475","DOI":"10.1145\/564744.564745"},{"key":"59_CR132","unstructured":"Srikant R, Agrawal R (1995) Mining generalized association rules. In: Proceeding of the 1995 international conference on very large data bases (VLDB\u201995), Zurich, Switzerland, pp 407\u2013419"},{"key":"59_CR133","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining sequential patterns: generalizations and performance improvements. In: Proceeding of the 5th international conference on extending database technology (EDBT\u201996), Avignon, France, pp 3\u201317","DOI":"10.1007\/BFb0014140"},{"key":"59_CR134","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/846183.846188","volume":"1","author":"J Srivastava","year":"2000","unstructured":"Srivastava J, Cooley R, Deshpande M, Tan PN (2000) Web usage mining: discovery and applications of usage patterns from web data. SIGKDD Explor 1:12\u201323","journal-title":"SIGKDD Explor"},{"key":"59_CR135","doi-asserted-by":"crossref","unstructured":"Steinbach M, Tan P, Kumar V (2004) Support envelopes: A technique for exploring the structure of association patterns. In: Proceeding of the 2004 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201904), Seattle, WA, pp 296\u2013305","DOI":"10.1145\/1014052.1014086"},{"key":"59_CR136","doi-asserted-by":"crossref","unstructured":"Tan P-N, Kumar V, Srivastava J (2002) Selecting the right interestingness measure for association patterns. In: Proceeding of the 2002 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201902), Edmonton, Canada, pp 32\u201341","DOI":"10.1145\/775052.775053"},{"key":"59_CR137","doi-asserted-by":"crossref","unstructured":"Ting R, Bailey J (2006) Mining minimal contrast subgraph patterns. In: Proceeding of the 2006 SIAM international conference on data mining (SDM\u201906), Bethesda, MD, pp 638\u2013642","DOI":"10.1137\/1.9781611972764.76"},{"key":"59_CR138","unstructured":"Toivonen H (1996) Sampling large databases for association rules. In: Proceeding of the 1996 international conference on very large data bases (VLDB\u201996), Bombay, India, pp 134\u2013145"},{"key":"59_CR139","doi-asserted-by":"crossref","unstructured":"Ukkonen A, Fortelius M, Mannila H (2005) Finding partial orders from unordered 0-1 data. In: Proceeding of the 2005 international conference on knowledge discovery and data mining (KDD\u201905), Chicago, IL, pp 285\u2013293","DOI":"10.1145\/1081870.1081904"},{"key":"59_CR140","doi-asserted-by":"crossref","unstructured":"Vanetik N, Gudes E, Shimony SE (2002) Computing frequent graph patterns from semistructured data. In: Proceeding of the 2002 international conference on data mining (ICDM\u201902), Maebashi, Japan, pp 458\u2013465","DOI":"10.1109\/ICDM.2002.1183988"},{"key":"59_CR141","doi-asserted-by":"crossref","unstructured":"Wang J, Han J (2004) BIDE: Efficient mining of frequent closed sequences. In: Proceeding of the 2004 international conference on data engineering (ICDE\u201904), Boston, MA, pp 79\u201390","DOI":"10.1109\/ICDE.2004.1319986"},{"key":"59_CR142","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J Wang","year":"2005","unstructured":"Wang J, Han J, Lu Y, Tzvetkov P (2005) TFP: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans Knowl Data Eng 17:652\u2013664","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"59_CR143","doi-asserted-by":"crossref","unstructured":"Wang J, Han J, Pei J (2003) CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: Proceeding of the 2003 ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201903), Washington, DC, pp 236\u2013245","DOI":"10.1145\/956755.956779"},{"key":"59_CR144","doi-asserted-by":"crossref","unstructured":"Wang K, Jiang Y, Lakshmanan L (2003) Mining unexpected rules by pushing user dynamics. In: Proceeding of the 2003 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201903), Washington, DC, pp 246\u2013255","DOI":"10.1145\/956755.956780"},{"key":"59_CR145","doi-asserted-by":"crossref","unstructured":"Wang J, Karypis G (2005) HARMONY: efficiently mining the best rules for classification. In: Proceeding of the 2005 SIAM conference on data mining (SDM\u201905), Newport Beach, CA, pp 205\u2013216","DOI":"10.1137\/1.9781611972757.19"},{"key":"59_CR146","doi-asserted-by":"crossref","unstructured":"Wang W, Lu H, Feng J, Yu JX (2002) Condensed cube: an effective approach to reducing data cube size. In: Proceeding of the 2002 international conference on data engineering (ICDE\u201902), San Fransisco, CA, pp 155\u2013165","DOI":"10.1109\/ICDE.2002.994705"},{"key":"59_CR147","doi-asserted-by":"crossref","unstructured":"Wang C, Wang W, Pei J, Zhu Y, Shi B (2004) Scalable mining of large disk-base graph databases. In: Proceeding of the 2004 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201904), Seattle, WA, pp 316\u2013325","DOI":"10.1145\/1014052.1014088"},{"key":"59_CR148","doi-asserted-by":"crossref","unstructured":"Wang H, Wang W, Yang J, Yu PS (2002) Clustering by pattern similarity in large data sets. In: Proceeding of the 2002 ACM-SIGMOD international conference on management of data (SIGMOD\u201902), Madison, WI, pp 418\u2013427","DOI":"10.1145\/564736.564737"},{"key":"59_CR149","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T Washio","year":"2003","unstructured":"Washio T, Motoda H (2003) State of the art of graph-based data mining. SIGKDD Explor 5:59\u201368","journal-title":"SIGKDD Explor"},{"key":"59_CR150","doi-asserted-by":"crossref","unstructured":"Xin D, Han J, Li X, Wah WB (2003) Star-cubing: computing iceberg cubes by top-down and bottom-up integration. In: Proceeding of the 2003 international conference on very large data bases (VLDB\u201903), Berlin, Germany, pp 476\u2013487","DOI":"10.1016\/B978-012722442-8\/50049-5"},{"key":"59_CR151","doi-asserted-by":"crossref","unstructured":"Xin D, Han J, Shao Z, Liu H (2006) C-cubing: efficient computation of closed cubes by aggregation-based checking. In: Proceeding of the 2006 international conference on data engineering (ICDE\u201906), Atlanta, Georgia, p 4","DOI":"10.1109\/ICDE.2006.31"},{"key":"59_CR152","unstructured":"Xin D, Han J, Yan X, Cheng H (2005) Mining compressed frequent-pattern sets. In: Proceeding of the 2005 international conference on very large data bases (VLDB\u201905), Trondheim, Norway, pp 709\u2013720"},{"key":"59_CR153","doi-asserted-by":"crossref","unstructured":"Xin D, Shen X, Mei Q, Han J (2006) Discovering interesting patterns through user\u2019s interactive feedback. In: Proceeding of the 2006 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201906), Philadelphia, PA, pp 773\u2013778","DOI":"10.1145\/1150402.1150502"},{"key":"59_CR154","doi-asserted-by":"crossref","unstructured":"Xiong H, Shekhar S, Huang Y, Kumar V, Ma X, Yoo JS (2004) A framework for discovering co-location patterns in data sets with extended spatial objects. In: Proceeding of the 2004 SIAM international conference on data mining (SDM\u201904), Lake Buena Vista, FL, pp 78\u201389","DOI":"10.1137\/1.9781611972740.8"},{"key":"59_CR155","doi-asserted-by":"crossref","unstructured":"Yan X, Cheng H, Han J, Xin D (2005) Summarizing itemset patterns: a profile-based approach. In: Proceeding of the 2005 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201905), Chicago, IL, pp 314\u2013323","DOI":"10.1145\/1081870.1081907"},{"key":"59_CR156","unstructured":"Yan X, Han J (2002) gSpan: graph-based substructure pattern mining. In: Proceeding of the 2002 international conference on data mining (ICDM\u201902), Maebashi, Japan, pp 721\u2013724"},{"key":"59_CR157","doi-asserted-by":"crossref","unstructured":"Yan X, Han J (2003) CloseGraph: mining closed frequent graph patterns. In: Proceeding of the 2003 ACM SIGKDD international conference on knowledge discovery and data mining (KDD\u201903), Washington, DC, pp 286\u2013295","DOI":"10.1145\/956755.956784"},{"key":"59_CR158","doi-asserted-by":"crossref","unstructured":"Yan X, Han J, Afshar R (2003) CloSpan: mining closed sequential patterns in large datasets. In: Proceeding of the 2003 SIAM international conference on data mining (SDM\u201903), San Fransisco, CA, pp 166\u2013177","DOI":"10.1137\/1.9781611972733.15"},{"key":"59_CR159","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: Proceeding of the 2004 ACM-SIGMOD international conference on management of data (SIGMOD\u201904), Paris, France, pp 335\u2013346","DOI":"10.1145\/1007568.1007607"},{"key":"59_CR160","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2005) Substructure similarity search in graph databases. In: Proceeding of the 2005 ACM-SIGMOD international conference on management of data (SIGMOD\u201905), Baltimore, MD, pp 766\u2013777","DOI":"10.1145\/1066157.1066244"},{"key":"59_CR161","doi-asserted-by":"crossref","unstructured":"Yan X, Zhou XJ, Han J (2005) Mining closed relational graphs with connectivity constraints. In: Proceeding of the 2005 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201905), Chicago, IL, pp 324\u2013333","DOI":"10.1145\/1081870.1081908"},{"key":"59_CR162","unstructured":"Yan X, Zhu F, Han J, Yu PS (2006) Searching substructures with superimposed distance. In: Proceeding of the 2006 international conference on data engineering (ICDE\u201906), Atlanta, Georgia, p 88"},{"key":"59_CR163","doi-asserted-by":"crossref","unstructured":"Yang G (2004) The complexity of mining maximal frequent itemsets and maximal frequent patterns. In: Proceeding of the 2004 ACM SIGKDD international conference on kowledge discovery in databases (KDD\u201904), Seattle, WA, pp 344\u2013353","DOI":"10.1145\/1014052.1014091"},{"key":"59_CR164","doi-asserted-by":"crossref","unstructured":"Yang C, Fayyad U, Bradley PS (2001) Efficient discovery of error-tolerant frequent itemsets in high dimensions. In: Proceeding of the 2001 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201901), San Fransisco, CA, pp 194\u2013203","DOI":"10.1145\/502512.502539"},{"key":"59_CR165","doi-asserted-by":"crossref","unstructured":"Yang LH, Lee M-L, Hsu W (2003) Efficient mining of xml query patterns for caching. In: VLDB, pp 69\u201380","DOI":"10.1016\/B978-012722442-8\/50015-X"},{"key":"59_CR166","doi-asserted-by":"crossref","unstructured":"Yang J, Wang W (2003) CLUSEQ: efficient and effective sequence clustering. In: Proceeding of the 2003 international conference on data engineering (ICDE\u201903), Bangalore, India, pp 101\u2013112","DOI":"10.1109\/ICDE.2003.1260785"},{"key":"59_CR167","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1109\/TKDE.2003.1198394","volume":"15","author":"J Yang","year":"2003","unstructured":"Yang J, Wang W, Yu PS (2003) Mining asynchronous periodic patterns in time series data. IEEE Trans Knowl Data Eng 15:613\u2013628","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"59_CR168","doi-asserted-by":"crossref","unstructured":"Yin X, Han J (2003) CPAR: classification based on predictive association rules. In: Proceeding of the 2003 SIAM international conference on data mining (SDM\u201903), San Fransisco, CA, pp 331\u2013335","DOI":"10.1137\/1.9781611972733.40"},{"key":"59_CR169","unstructured":"Yoda K, Fukuda T, Morimoto Y, Morishita S, Tokuyama T (1997) Computing optimized rectilinear regions for association rules. In: Proceeding of the 1997 international conference on knowledge discovery and data mining (KDD\u201997), Newport Beach, CA, pp 96\u2013103"},{"key":"59_CR170","doi-asserted-by":"crossref","unstructured":"Yu JX, Chong Z, Lu H, Zhou A (2004) False positive or false negative: mining frequent itemsets from high speed transactional data streams. In: Proceeding of the 2004 international conference on very large data bases (VLDB\u201904), Toronto, Canada, pp 204\u2013215","DOI":"10.1016\/B978-012088469-8\/50021-8"},{"key":"59_CR171","doi-asserted-by":"crossref","unstructured":"Yun U, Leggett J (2005) Wfim: weighted frequent itemset mining with a weight range and a minimum weight. In: Proceeding of the 2005 SIAM international conference on data mining (SDM\u201905), Newport Beach, CA, pp 636\u2013640","DOI":"10.1137\/1.9781611972757.76"},{"key":"59_CR172","doi-asserted-by":"crossref","unstructured":"Za\u00efane OR, Han J, Zhu H (2000) Mining recurrent items in multimedia with progressive resolution refinement. In: Proceeding of the 2000 international conference on data engineering (ICDE\u201900), San Diego, CA, pp 461\u2013470","DOI":"10.1109\/ICDE.2000.839445"},{"key":"59_CR173","doi-asserted-by":"crossref","unstructured":"Zaki MJ (1998) Efficient enumeration of frequent sequences. In: Proceeding of the 7th international conference on information and knowledge management (CIKM\u201998), Washington, DC, pp 68\u201375","DOI":"10.1145\/288627.288643"},{"key":"59_CR174","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12:372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"59_CR175","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"40","author":"M Zaki","year":"2001","unstructured":"Zaki M (2001) SPADE: an efficient algorithm for mining frequent sequences. Mach Learn 40:31\u201360","journal-title":"Mach Learn"},{"key":"59_CR176","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2002) Efficiently mining frequent trees in a forest. In: Proceeding of the 2002 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201902), Edmonton, Canada, pp 71\u201380","DOI":"10.1145\/775056.775058"},{"key":"59_CR177","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Hsiao CJ (2002) CHARM: an efficient algorithm for closed itemset mining. In: Proceeding of the 2002 SIAM international conference on data mining (SDM\u201902), Arlington, VA, pp 457\u2013473","DOI":"10.1137\/1.9781611972726.27"},{"key":"59_CR178","unstructured":"Zaki MJ, Lesh N, Ogihara M (1998) PLANMINE: sequence mining for plan failures. In: Proceeding of the 1998 international conference on knowledge discovery and data mining (KDD\u201998), New York, NY, pp 369\u2013373"},{"key":"59_CR179","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1009773317876","volume":"1","author":"MJ Zaki","year":"1997","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W (1997) Parallel algorithm for discovery of association rules. data mining knowl discov, 1:343\u2013374","journal-title":"data mining knowl discov,"},{"key":"59_CR180","doi-asserted-by":"crossref","unstructured":"Zhang X, Mamoulis N, Cheung DW, Shou Y (2004) Fast mining of spatial collocations. In: Proceeding of the 2004 ACM SIGKDD international conference on knowledge discovery in databases (KDD\u201904), Seattle, WA, pp 384\u2013393","DOI":"10.1145\/1014052.1014095"},{"key":"59_CR181","doi-asserted-by":"crossref","unstructured":"Zhang H, Padmanabhan B, Tuzhilin A (2004) On the discovery of significant statistical quantitative rules. In: Proceeding of the 2004 international conference on knowledge discovery and data mining (KDD\u201904), Seattle, WA, pp 374\u2013383","DOI":"10.1145\/1014052.1014094"},{"key":"59_CR182","doi-asserted-by":"crossref","unstructured":"Zhu F, Yan X, Han J, Yu PS, Cheng H (2007) Mining colossal frequent patterns by core pattern fusion. In: Proceeding of the 2007 international conference on data engineering (ICDE\u201907), Istanbul, Turkey","DOI":"10.1109\/ICDE.2007.367916"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0059-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-006-0059-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0059-1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0059-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T01:30:14Z","timestamp":1736731814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-006-0059-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,27]]},"references-count":182,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,8]]}},"alternative-id":["59"],"URL":"https:\/\/doi.org\/10.1007\/s10618-006-0059-1","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,27]]},"assertion":[{"value":"22 June 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}