{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T19:26:40Z","timestamp":1792870000564,"version":"4.5.0"},"publisher-location":"Cham","reference-count":75,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319078205","type":"print"},{"value":"9783319078212","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07821-2_2","type":"book-chapter","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T02:36:06Z","timestamp":1409279766000},"page":"19-64","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":92,"title":["Frequent Pattern Mining Algorithms: A Survey"],"prefix":"10.1007","author":[{"given":"Charu C.","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mansurul A.","family":"Bhuiyan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad Al","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,8,30]]},"reference":[{"key":"2_CR1","unstructured":"R. Agrawal, and R. Srikant. Fast Algorithms for Mining Association Rules in Large Databases, VLDB Conference, pp.\u00a0487\u2013499, 1994."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. ACM SIGMOD Conference, 1993.","DOI":"10.1145\/170035.170072"},{"key":"2_CR3","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A.I. Verkamo. Fast discovery of association rules, Advances in Knowledge Discovery and Data Mining, pp.\u00a0307\u2013328, 1996."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"R. Agarwal, C. C. Aggarwal, and V. V. V. Prasad. Depth-first Generation of Long Patterns, ACM KDD Conference, 2000. Also available as IBM Research Report, RC21538, July 1999.","DOI":"10.1145\/347090.347114"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"R. Agarwal, C. C. Aggarwal, and V. V. V. Prasad. A Tree Projection Algorithm for Generation of Frequent Itemsets, Journal of Parallel and Distributed Computing, 61(3), pp.\u00a0350\u2013371, 2001. Also available as IBM Research Report, RC21341, 1999.","DOI":"10.1006\/jpdc.2000.1693"},{"key":"2_CR6","unstructured":"C. C. Aggarwal, P. S. Yu. Online Generation of Association Rules, ICDE Conference, 1998."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"C. C. Aggarwal, P. S. Yu. A New Framework for Itemset Generation, ACM PODS Conference, 1998.","DOI":"10.1145\/275487.275490"},{"key":"2_CR8","unstructured":"E. Azkural and C. Aykanat. A Space Optimization for FP-Growth, FIMI workshop, 2004."},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y. Bastide","year":"2000","unstructured":"Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining Frequent Patterns with Counting Inference. ACM SIGKDD Explorations Newsletter, 2(2), pp.\u00a066\u201375, 2000.","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"R. J. Bayardo Jr. Efficiently mining long patterns from databases, ACM SIGMOD Conference, 1998.","DOI":"10.1145\/276304.276313"},{"key":"2_CR11","unstructured":"J. Blanchard, F. Guillet, R. Gras, and H. Briand. Using Information-theoretic Measures to Assess Association Rule Interestingness. ICDM Conference, 2005."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"C. Borgelt, R. Kruse. Induction of Association Rules: Apriori Implementation, Conference on Computational Statistics, 2002. URL","DOI":"10.1007\/978-3-642-57489-4_59"},{"issue":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021571501451","volume":"7","author":"J.-F. Boulicaut","year":"2003","unstructured":"J.-F. Boulicaut, A. Bykowski, and C. Rigotti. Free-sets: A Condensed Representation of Boolean data for the Approximation of Frequency Queries. Data Mining and Knowledge Discovery, 7(1), pp.\u00a05\u201322, 2003.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2_CR14","unstructured":"D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases, ICDE Conference, 2000. Implementation URL: URL"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, J.D. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. ACM SIGMOD Conference, 1997.","DOI":"10.1145\/253260.253325"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"S. Brin, R. Motwani, and C. Silverstein. Beyond Market Baskets: Generalizing Association Rules to Correlations. ACM SIGMOD Conference, 1997.","DOI":"10.1145\/253260.253327"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"T. Calders, and B. Goethals. Mining all non-derivable frequent itemsets Principles of Data Mining and Knowledge Discovery, pp.\u00a01\u201342, 2002.","DOI":"10.1007\/3-540-45681-3_7"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"T. Calders, and B. Goethals. Depth-first Non-derivable Itemset Mining, SDM Conference, 2005.","DOI":"10.1137\/1.9781611972757.23"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"T. Calders, N. Dexters, J. Gillis, and B. Goethals. Mining Frequent Itemsets in a Stream, Informations Systems, to appear, 2013.","DOI":"10.1016\/j.is.2012.01.005"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"J. H. Chang, and W. S. Lee. Finding Recent Frequent Itemsets Adaptively over Online Data Streams, ACM KDD Conference, 2003.","DOI":"10.1145\/956750.956807"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"M. Charikar, K. Chen, and M. Farach-Colton. Finding Frequent Items in Data Streams. Automata, Languages and Programming, pp.\u00a0693\u2013703, 2002.","DOI":"10.1007\/3-540-45465-9_59"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"G. Cong, A. K. H. Tung, X. Xu, F. Pan, and J. Yang. FARMER: Finding interesting rule groups in microarray datasets. ACM SIGMOD Conference, 2004.","DOI":"10.1145\/1007568.1007587"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"G. Cong, K.-L. Tan, A. K. H. Tung, X. Xu. Mining Top-k covering Rule Groups for Gene Expression Data. ACM SIGMOD Conference, 2005.","DOI":"10.1145\/1066157.1066234"},{"key":"2_CR24","unstructured":"M. El-Hajj and O. Zaiane. COFI-tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation. FIMI Workshop, 2003."},{"key":"2_CR25","unstructured":"F. Geerts, B. Goethals, J. Bussche. A Tight Upper Bound on the Number of Candidate Patterns, ICDM Conference, 2001."},{"key":"2_CR26","unstructured":"B. Goethals. Survey on frequent pattern mining, Technical report, University of Helsinki, 2003."},{"key":"2_CR27","unstructured":"R. P. Gopalan and Y. G. Sucahyo. High Performance Frequent Pattern Extraction using Compressed FP-Trees, Proceedings of SIAM International Workshop on High Performance and Distributed Mining, 2004."},{"issue":"3","key":"2_CR28","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10618-005-0002-x","volume":"11","author":"K. Gouda","year":"2005","unstructured":"K. Gouda, and M. Zaki. Genmax: An efficient algorithm for mining maximal frequent itemsets. Data Mining and Knowledge Discovery, 11(3), pp.\u00a0223\u2013242, 2005.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2_CR29","unstructured":"G. Grahne, and J. Zhu. Efficiently Using Prefix-trees in Mining Frequent Itemsets, IEEE ICDM Workshop on Frequent Itemset Mining, 2004."},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"10","author":"G. Grahne","year":"2005","unstructured":"G. Grahne, and J. Zhu. Fast Algorithms for Frequent Itemset Mining Using FP-Trees. IEEE Transactions on Knowledge and Data Engineering. 17(10), pp.\u00a01347\u20131362, 2005, vol.\u00a017, no.\u00a010, pp.\u00a01347\u20131362, October, 2005.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"2_CR31","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.parco.2004.03.003","volume":"30","author":"V. Guralnik","year":"2004","unstructured":"V. Guralnik, and G. Karypis. Parallel tree-projection-based sequence mining algorithms. Parallel Computing, 30(4): pp.\u00a0443\u2013472, April 2004.","journal-title":"Parallel Computing"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation, ACM SIGMOD Conference, 2000.","DOI":"10.1145\/342009.335372"},{"issue":"1","key":"2_CR33","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J. Han","year":"2007","unstructured":"J. Han, H. Cheng, D. Xin, and X. Yan. Frequent Pattern Mining: Current Status and Future Directions, Data Mining and Knowledge Discovery, 15(1), pp.\u00a055\u201386, 2007.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"C. Hidber. Online Association Rule Mining, ACM SIGMOD Conference, 1999.","DOI":"10.1145\/304182.304195"},{"key":"2_CR35","unstructured":"R. Jin, and G. Agrawal. An Algorithm for in-core Frequent Itemset Mining on Streaming Data, ICDM Conference, 2005."},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Q. Lan, D. Zhang, and B. Wu. A New Algorithm For Frequent Itemsets Mining Based On Apriori And FP-Tree, IEEE International Conference on Global Congress on Intelligent Systems, pp.\u00a0360\u2013364, 2009.","DOI":"10.1109\/GCIS.2009.387"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"D.-I. Lin, and Z. Kedem. Pincer-search: A New Algorithm for Discovering the Maximum Frequent Set, EDBT Conference, 1998.","DOI":"10.1007\/BFb0100980"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"J. Liu, Y. Pan, K. Wang. Mining Frequent Item Sets by Opportunistic Projection, ACM KDD Conference, 2002.","DOI":"10.1145\/775047.775081"},{"key":"2_CR39","unstructured":"G. Liu, H. Lu and J. X. Yu. AFOPT:An Efficient Implementation of Pattern Growth Approach, FIMI Workshop, 2003."},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"H. Liu, J. Han, D. Xin, and Z. Shao. Mining frequent patterns on very high dimensional data: a top- down row enumeration approach. SDM Conference, 2006.","DOI":"10.1137\/1.9781611972764.25"},{"key":"2_CR41","unstructured":"C. Lucchesse, S. Orlando, and R. Perego. DCI-Closed: A fast and memory efficient algorithm to mine frequent closed itemsets. FIMI Workshop, 2004."},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"C. Lucchese, S. Orlando, and R. Perego. Fast and memory efficient mining of frequent closed itemsets. IEEE TKDE Journal, 18(1), pp.\u00a021\u201336, January 2006.","DOI":"10.1109\/TKDE.2006.10"},{"key":"2_CR43","doi-asserted-by":"crossref","unstructured":"G. Manku, R. Motwani. Approximate Frequency Counts over Data Streams. VLDB Conference, 2002.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"2_CR44","unstructured":"H. Mannila, H. Toivonen, and A.I. Verkamo. Efficient algorithms for discovering association rules. Proceedings of the AAAI Workshop on Knowledge Discovery in Databases, pp.\u00a0181\u2013192, 1994."},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"B. Negrevergne, T. Guns, A. Dries, and S. Nijssen. Dominance Programming for Itemset Mining. IEEE ICDM Conference, 2013.","DOI":"10.1109\/ICDM.2013.92"},{"key":"2_CR46","unstructured":"S. Orlando, P. Palmerini, R. Perego. Enhancing the a-priori algorithm for frequent set counting, Third International Conference on Data Warehousing and Knowledge Discovery, 2001."},{"key":"2_CR47","unstructured":"S. Orlando, P. Palmerini, R. Perego, and F. Silvestri. Adaptive and resource-aware mining of frequent sets. ICDM Conference, 2002."},{"key":"2_CR48","unstructured":"F. Pan, G. Cong, A. K. H. Tung, J. Yang, and M. J. Zaki. Finding closed patterns in long biological datasets. ACM KDD Conference, 2003."},{"key":"2_CR49","unstructured":"F Pan, A. K. H. Tung, G. Cong, X. Xu. COBBLER: Combining column and Row Enumeration for Closed Pattern Discovery. SSDBM, 2004."},{"key":"2_CR50","doi-asserted-by":"crossref","unstructured":"J.-S. Park, M. S. Chen, and P. S. Yu. An Effective Hash-based Algorithm for Mining Association Rules, ACM SIGMOD Conference, 1995.","DOI":"10.1145\/223784.223813"},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. ICDT Conference, 1999.","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"1","key":"2_CR52","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0306-4379(99)00003-4","volume":"24","author":"N. Pasquier","year":"1999","unstructured":"N. Pasquier, Y. Bastide, R. Taouil, and L. Lakhal. Efficient mining of association rules using closed itemset lattices. Journal of Information Systems, 24(1), pp.\u00a025\u201346, 1999.","journal-title":"Journal of Information Systems"},{"key":"2_CR53","unstructured":"J. Pei, J. Han, and R. Mao. CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets, DMKD Workshop, 2000."},{"key":"2_CR54","unstructured":"J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, D. Yang. H-mine: Hyper-structure mining of frequent patterns in large databases, ICDM Conference, 2001."},{"key":"2_CR55","unstructured":"B. Racz. nonordfp: An FP-Growth Variation without Rebuilding the FP-Tree, FIMI Workshop, 2004."},{"key":"2_CR56","unstructured":"M. Holsheimer, M. Kersten, H. Mannila, and H. Toivonen. A Perspective on Databases and Data Mining, ACM KDD Conference, 1995."},{"key":"2_CR57","unstructured":"A. Savasere, E. Omiecinski, and S. Navathe. An efficient algorithm for mining association rules in large databases. VLDB Conference, 1995."},{"key":"2_CR58","doi-asserted-by":"crossref","unstructured":"P. Shenoy, J. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, D. Shah. Turbo-charging Vertical Mining of Large Databases. ACM SIGMOD Conference, pp.\u00a022\u201333, 2000.","DOI":"10.1145\/335191.335376"},{"key":"2_CR59","unstructured":"Z. Shi, and Q. He. Efficiently Mining Frequent Itemsets with Compact FP-Tree, IFIP International Federation for Information Processing, V-163, pp.\u00a0397\u2013406, 2005."},{"key":"2_CR60","unstructured":"R. Srikant. Fast algorithms for mining association rules and sequential patterns. PhD thesis, University of Wisconsin, Madison, 1996."},{"key":"2_CR61","unstructured":"Y. G. Sucahyo and R. P. Gopalan. CT-ITL: Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with PatternGrowth, Proceedings of the 14th Australasian Database Conference, 2003."},{"key":"2_CR62","unstructured":"Y. G. Sucahyo and R. P. Gopalan. CT-PRO: A Bottom Up Non Recursive Frequent Itemset Mining Algorithm Using Compressed FP-Tree Data Structures. FIMI Workshop, 2004."},{"key":"2_CR63","doi-asserted-by":"crossref","unstructured":"P.-N. Tan, V. Kumar, amd J. Srivastava. Selecting the Right Interestingness Measure for Association Patterns. ACM KDD Conference, 2002.","DOI":"10.1145\/775047.775053"},{"key":"2_CR64","doi-asserted-by":"crossref","unstructured":"I. Taouil, N. Pasquier, Y. Bastide, and L. Lakhal. Mining Basis for Association Rules using Closed Sets, ICDE Conference, 2000.","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"2_CR65","unstructured":"H. Toivonen. Sampling large databases for association rules. VLDB Conference, 1996."},{"key":"2_CR66","unstructured":"T. Uno, M. Kiyomi and H. Arimura. Efficient Mining Algorithms for Frequent\/Closed\/Maximal Itemsets, FIMI Workshop, 2004."},{"key":"2_CR67","unstructured":"J. Wang, J. Han. BIDE: Efficient Mining of Frequent Closed Sequences. ICDE Conference, 2004."},{"key":"2_CR68","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J. Wang","year":"2002","unstructured":"J. Wang, J. Han, Y. Lu, and P. Tzvetkov. TFP: An efficient algorithm for mining top-k frequent closed itemsets. IEEE Transactions on Knowledge and Data Engineering, 17, pp.\u00a0652\u2013664, 2002.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2_CR69","doi-asserted-by":"crossref","unstructured":"J. Wang, J. Han, and J. Pei. CLOSET+: Searching for the Best strategies for mining frequent closed itemsets. ACM KDD Conference, 2003.","DOI":"10.1145\/956750.956779"},{"key":"2_CR70","doi-asserted-by":"crossref","unstructured":"G. I. Webb. Efficient Search for Association Rules, ACM KDD Conference, 2000.","DOI":"10.1145\/347090.347112"},{"issue":"3","key":"2_CR71","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"M. J. Zaki","year":"2000","unstructured":"M. J. Zaki. Scalable algorithms for association mining, IEEE Transactions on Knowledge and Data Engineering, 12(3), pp.\u00a0372\u2013390, 2000.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"2_CR72","doi-asserted-by":"crossref","unstructured":"M. Zaki, and K. Gouda. Fast vertical mining using diffsets. ACM KDD Conference, 2003.","DOI":"10.1145\/956750.956788"},{"key":"2_CR73","doi-asserted-by":"crossref","unstructured":"M. J. Zaki and C. Hsiao. CHARM: An efficient algorithm for closed association rule mining. SDM Conference, 2002.","DOI":"10.1137\/1.9781611972726.27"},{"key":"2_CR74","doi-asserted-by":"crossref","unstructured":"M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New Algorithms for Fast Discovery of Association Rules. KDD Conference, pp.\u00a0283\u2013286, 1997.","DOI":"10.1007\/978-1-4615-5669-5_1"},{"key":"2_CR75","doi-asserted-by":"crossref","unstructured":"C. Zeng, J. F. Naughton, and JY Cai. On Differentially Private Frequent Itemset Mining. In Proceedings of 39th International Conference on Very Large data Bases, 2012.","DOI":"10.14778\/2428536.2428539"}],"container-title":["Frequent Pattern Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07821-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T19:08:30Z","timestamp":1675105710000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-07821-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319078205","9783319078212"],"references-count":75,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07821-2_2","relation":{},"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"30 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}