{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T13:26:30Z","timestamp":1772112390553,"version":"3.50.1"},"reference-count":85,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T00:00:00Z","timestamp":1153785600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2006,7,25]]},"abstract":"<jats:p>The task of finding correlations between items in a dataset, association mining, has received considerable attention over the last decade. This article presents a survey of association mining fundamentals, detailing the evolution of association mining algorithms from the seminal to the state-of-the-art. This survey focuses on the fundamental principles of association mining, that is, itemset identification, rule generation, and their generic optimizations.<\/jats:p>","DOI":"10.1145\/1132956.1132958","type":"journal-article","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T14:14:26Z","timestamp":1153836866000},"page":"5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":196,"title":["Association mining"],"prefix":"10.1145","volume":"38","author":[{"given":"Aaron","family":"Ceglar","sequence":"first","affiliation":[{"name":"Flinders University of South Australia, South Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John F.","family":"Roddick","sequence":"additional","affiliation":[{"name":"Flinders University of South Australia, South Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,7,25]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94)","author":"Agrawal R.","unstructured":"Agrawal , R. and Srikant , R . 1994. Fast algorithms for mining association rules . In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94) , Santiago, Chile. B. Bocca, M. Jarke, and C. Zaniolo, Eds. Morgan Kaufmann, 487--499.]] Agrawal, R. and Srikant, R. 1994. Fast algorithms for mining association rules. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB'94), Santiago, Chile. B. Bocca, M. Jarke, and C. Zaniolo, Eds. Morgan Kaufmann, 487--499.]]"},{"key":"e_1_2_1_3_1","volume-title":"High Performance Data Mining Workshop. Puerto Rico. ACM Press.]]","author":"Agrawal R. C.","unstructured":"Agrawal , R. C. , Aggarwal , C. C. , and Prasad , V. V. V. 1999. A tree projection algorithm for generation of frequent itemsets . High Performance Data Mining Workshop. Puerto Rico. ACM Press.]] Agrawal, R. C., Aggarwal, C. C., and Prasad, V. V. V. 1999. A tree projection algorithm for generation of frequent itemsets. High Performance Data Mining Workshop. Puerto Rico. ACM Press.]]"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347114"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 6th International Federation for Information Processing Congress (IFIP).","volume":"74","author":"Armstrong W. W.","year":"1974","unstructured":"Armstrong , W. W. 1974 . Dependency structures of data base relationships . In Proceedings of the 6th International Federation for Information Processing Congress (IFIP). Vol. 74 . North Holland, Amsterdam, The Netherlands, 580--583.]] Armstrong, W. W. 1974. Dependency structures of data base relationships. In Proceedings of the 6th International Federation for Information Processing Congress (IFIP). Vol. 74. North Holland, Amsterdam, The Netherlands, 580--583.]]"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the 1st International Conference on Computational Logic, (CL'00)","volume":"1861","author":"Bastide Y.","unstructured":"Bastide , Y. , Pasquier , N. , Taouil , R. , Stumme , G. , and Lakhal , L . 2000. Mining minimal non-redundant association rules using frequent closed itemsets . In Proceedings of the 1st International Conference on Computational Logic, (CL'00) , J. W. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, and P. J. Stuckey, Eds. Lecture Notes in Computer Science , vol. 1861 . Springer, Berlin, Germany, 972--986.]] Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., and Lakhal, L. 2000. Mining minimal non-redundant association rules using frequent closed itemsets. In Proceedings of the 1st International Conference on Computational Logic, (CL'00), J. W. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv, and P. J. Stuckey, Eds. Lecture Notes in Computer Science, vol. 1861. Springer, Berlin, Germany, 972--986.]]"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/380995.381017"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312219"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03)","volume":"90","author":"Bodon F.","year":"2003","unstructured":"Bodon , F. 2003 . A fast Apriori implementation . In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03) , Melbourne, Fl. B. Goethals and M. J. Zaki, Eds. CEUR Workshop Proceedings , vol. 90 . IEEE Press.]] Bodon, F. 2003. A fast Apriori implementation. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), Melbourne, Fl. B. Goethals and M. J. Zaki, Eds. CEUR Workshop Proceedings, vol. 90. IEEE Press.]]"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021571501451"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253325"},{"key":"e_1_2_1_13_1","volume-title":"Mafia: A maximal frequent itemset algorithm for transactional databases. In Proceedings of the 17th International Conference on Data Engineering","author":"Burdick D.","year":"2001","unstructured":"Burdick , D. , Calimlim , M. , and Gehrke , J . 2001 . Mafia: A maximal frequent itemset algorithm for transactional databases. In Proceedings of the 17th International Conference on Data Engineering , Heidelburg, Germany , IEEE Press , 443--452.]] Burdick, D., Calimlim, M., and Gehrke, J. 2001. Mafia: A maximal frequent itemset algorithm for transactional databases. In Proceedings of the 17th International Conference on Data Engineering, Heidelburg, Germany, IEEE Press, 443--452.]]"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375604"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery","volume":"2431","author":"Calders T.","unstructured":"Calders , T. and Goethals , B . 2002. Mining all non-derivable frequent itemsets . In Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery , Helsinki, Finland. T. Elomaa, H. Mannila, and H. Toivonen, Eds. Lecture Note in Artificial Intelligence , vol. 2431 . Springer, Berlin, Germany, 74--85.]] Calders, T. and Goethals, B. 2002. Mining all non-derivable frequent itemsets. In Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery, Helsinki, Finland. T. Elomaa, H. Mannila, and H. Toivonen, Eds. Lecture Note in Artificial Intelligence, vol. 2431. Springer, Berlin, Germany, 74--85.]]"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775114"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 17th International Conference on Data Engineering (ICDE)","author":"Choudhuri S.","unstructured":"Choudhuri , S. , Datar , M. , Motwani , R. , and Narasayya , V . 2001. Overcoming limitations of sampling for aggregation queries . In Proceedings of the 17th International Conference on Data Engineering (ICDE) , Heidelburg, Germany. IEEE Press, 534--542.]] Choudhuri, S., Datar, M., Motwani, R., and Narasayya, V. 2001. Overcoming limitations of sampling for aggregation queries. In Proceedings of the 17th International Conference on Data Engineering (ICDE), Heidelburg, Germany. IEEE Press, 534--542.]]"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02)","author":"Cristofor L.","unstructured":"Cristofor , L. and Simovici , D . 2002. Generating an informative cover for association rules . In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02) , Washington, DC. IEEE Computer Society, 597--613.]] Cristofor, L. and Simovici, D. 2002. Generating an informative cover for association rules. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM'02), Washington, DC. IEEE Computer Society, 597--613.]]"},{"key":"e_1_2_1_19_1","unstructured":"Deshaspe L. and Toivonen H. 1998. Frequent query discovery: A unifying approach to association rule mining. Tech. rep. CW-258 Department of Computer Science Katholieke Universiteit Leuven.]]  Deshaspe L. and Toivonen H. 1998. Frequent query discovery: A unifying approach to association rule mining. Tech. rep. CW-258 Department of Computer Science Katholieke Universiteit Leuven.]]"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 2nd Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining (PAKDD'98)","volume":"1394","author":"Dong G.","unstructured":"Dong , G. and Li , J . 1998. Interestingness of discovered association rules in terms of neighbourhood-based unexpectedness . In Proceedings of the 2nd Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining (PAKDD'98) , Melbourne, Australia, X. Wu, R. Kotagiri, and K. Korb, Eds. Lecture Notes in Artificial Intelligence , vol. 1394 . Springer, Berlin, Germany, 72--86.]] Dong, G. and Li, J. 1998. Interestingness of discovered association rules in terms of neighbourhood-based unexpectedness. In Proceedings of the 2nd Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining (PAKDD'98), Melbourne, Australia, X. Wu, R. Kotagiri, and K. Korb, Eds. Lecture Notes in Artificial Intelligence, vol. 1394. Springer, Berlin, Germany, 72--86.]]"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 15th International Conference on Data Engineering","author":"Dunkel B.","unstructured":"Dunkel , B. and Soparkar , N . 1999. Data organization and access for efficient data mining . In Proceedings of the 15th International Conference on Data Engineering , Sydney, Australia. IEEE, 522--532.]] Dunkel, B. and Soparkar, N. 1999. Data organization and access for efficient data mining. In Proceedings of the 15th International Conference on Data Engineering, Sydney, Australia. IEEE, 522--532.]]"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-7051(99)00019-2"},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Ganter G. and Wille R. 1999. Formal Concept Analysis: Mathematical Foundations. Springer Berlin Germany.]]   Ganter G. and Wille R. 1999. Formal Concept Analysis: Mathematical Foundations. Springer Berlin Germany.]]","DOI":"10.1007\/978-3-642-59830-2"},{"key":"e_1_2_1_24_1","unstructured":"Gardarin G. Pucheral P. and Wu F. 1998. Bitmap based algorithms for mining association rules. 14th Bases de Donnes Avances (BDA'98). Hammamet Tunisia Springer Berlin Germany 157--176.]]  Gardarin G. Pucheral P. and Wu F. 1998. Bitmap based algorithms for mining association rules. 14th Bases de Donnes Avances (BDA'98). Hammamet Tunisia Springer Berlin Germany 157--176.]]"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/645927.672351"},{"key":"e_1_2_1_26_1","volume-title":"5th SIAM International Conference on Data Mining (SDM'05)","author":"Goethals B.","unstructured":"Goethals , B. , Muhonen , J. , and Toivonen , H . 2005. Mining non-derivable association rules . 5th SIAM International Conference on Data Mining (SDM'05) . Newport Beach, CA.]] Goethals, B., Muhonen, J., and Toivonen, H. 2005. Mining non-derivable association rules. 5th SIAM International Conference on Data Mining (SDM'05). Newport Beach, CA.]]"},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the 2002 Internatiional Conference on Fuzzy Systems and Knowledge Discovery","volume":"1","author":"Gopalan R. P.","unstructured":"Gopalan , R. P. and Sucahyo , Y. G . 2002. ITL-mine: Mining frequent itemsets more efficiently . In Proceedings of the 2002 Internatiional Conference on Fuzzy Systems and Knowledge Discovery , Singapore, L. Wang, S. Halgamuge, and X. Yao, Eds. Vol. 1 . Springer, Berlin, Germany, 167--172.]] Gopalan, R. P. and Sucahyo, Y. G. 2002. ITL-mine: Mining frequent itemsets more efficiently. In Proceedings of the 2002 Internatiional Conference on Fuzzy Systems and Knowledge Discovery, Singapore, L. Wang, S. Halgamuge, and X. Yao, Eds. Vol. 1. Springer, Berlin, Germany, 167--172.]]"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the IEEE International Conference on Data Mining","author":"Gouda K.","unstructured":"Gouda , K. and Zaki , M. J . 2001. Efficiently mining maximal frequent itemsets . In Proceedings of the IEEE International Conference on Data Mining , San Jose. IEEE Press, CA.]] Gouda, K. and Zaki, M. J. 2001. Efficiently mining maximal frequent itemsets. In Proceedings of the IEEE International Conference on Data Mining, San Jose. IEEE Press, CA.]]"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-7051(00)00055-1"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03)","volume":"90","author":"Grahne G.","unstructured":"Grahne , G. and Zhu , J . 2003a. Efficiently using prefix-trees in mining frequent itemsets . In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03) , Melbourne, FL. B. Goethals and M. J. Zaki, Eds. Vol. 90 . IEEE Press.]] Grahne, G. and Zhu, J. 2003a. Efficiently using prefix-trees in mining frequent itemsets. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), Melbourne, FL. B. Goethals and M. J. Zaki, Eds. Vol. 90. IEEE Press.]]"},{"key":"e_1_2_1_31_1","volume-title":"6th SIAM International Workshop on High Performance Data Mining (HPDM'03)","author":"Grahne G.","unstructured":"Grahne , G. and Zhu , J . 2003b. High performance mining of maximal frequent itemsets . 6th SIAM International Workshop on High Performance Data Mining (HPDM'03) . San Francisco, CA.]] Grahne, G. and Zhu, J. 2003b. High performance mining of maximal frequent itemsets. 6th SIAM International Workshop on High Performance Data Mining (HPDM'03). San Francisco, CA.]]"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 6th International Conference on Database Theory","author":"Gunopulos D.","unstructured":"Gunopulos , D. , Mannila , H. , and Saluja , S . 1997. Discovering all most specific sentences by randomised algorithms extended abstract . In Proceedings of the 6th International Conference on Database Theory . Delphi, Greece, F. Afrati and P. Kolaitis, Eds. Springer, Berlin, Germany. 251--229.]] Gunopulos, D., Mannila, H., and Saluja, S. 1997. Discovering all most specific sentences by randomised algorithms extended abstract. In Proceedings of the 6th International Conference on Database Theory. Delphi, Greece, F. Afrati and P. Kolaitis, Eds. Springer, Berlin, Germany. 251--229.]]"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/380995.381002"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 3rd European Conference on Principles of Knowledge Discovery in Databases (PKDD'99)","volume":"1704","author":"Hilderman R. J.","unstructured":"Hilderman , R. J. and Hamilton , H. J . 1999. Heuristic measures of interestingness . In Proceedings of the 3rd European Conference on Principles of Knowledge Discovery in Databases (PKDD'99) , J. Zytkow and J. Rauch, Eds. Lecture Notes in Artificial Intelligence , vol. 1704 . Springer, Berlin, Germany. 232--241.]] Hilderman, R. J. and Hamilton, H. J. 1999. Heuristic measures of interestingness. In Proceedings of the 3rd European Conference on Principles of Knowledge Discovery in Databases (PKDD'99), J. Zytkow and J. Rauch, Eds. Lecture Notes in Artificial Intelligence, vol. 1704. Springer, Berlin, Germany. 232--241.]]"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining, (PAKDD'01)","volume":"2035","author":"Hilderman R. J.","unstructured":"Hilderman , R. J. and Hamilton , H. J . 2001. Evaluation of interestingness measures for ranking discovered knowledge . In Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining, (PAKDD'01) , Hong Kong, China, D. W.-L. Cheung, G. J. Williams, and Q. Li, Eds. Lecture Notes in Computer Science , vol. 2035 . Springer, Berlin, Germany, 247--259.]] Hilderman, R. J. and Hamilton, H. J. 2001. Evaluation of interestingness measures for ranking discovered knowledge. In Proceedings of the 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining, (PAKDD'01), Hong Kong, China, D. W.-L. Cheung, G. J. Williams, and Q. Li, Eds. Lecture Notes in Computer Science, vol. 2035. Springer, Berlin, Germany, 247--259.]]"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/360402.360421"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/645804.669816"},{"key":"e_1_2_1_38_1","unstructured":"Houtsma M. and Swami A. 1993. Set oriented mining of association rules. Tech. rep. RJ 9567 IBM Almaden Research Centre.]]  Houtsma M. and Swami A. 1993. Set oriented mining of association rules. Tech. rep. RJ 9567 IBM Almaden Research Centre.]]"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/182591.182601"},{"key":"e_1_2_1_40_1","volume-title":"IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03)","author":"Kosters W. A.","unstructured":"Kosters , W. A. and Pijls , W . 2003. Apriori, a depth first implementation . IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03) . Melbourne, FL, B. Goethals and M. J. Zaki, Eds. IEEE Press.]] Kosters, W. A. and Pijls, W. 2003. Apriori, a depth first implementation. IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03). Melbourne, FL, B. Goethals and M. J. Zaki, Eds. IEEE Press.]]"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/646471.692202"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/647915.738875"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the 4th SIAM International Conference on Data Mining (SDM'04)","author":"Li G.","unstructured":"Li , G. and Hamilton , H. J . 2004. Basic association rules . In Proceedings of the 4th SIAM International Conference on Data Mining (SDM'04) . Orlando, FL.]] Li, G. and Hamilton, H. J. 2004. Basic association rules. In Proceedings of the 4th SIAM International Conference on Data Mining (SDM'04). Orlando, FL.]]"},{"key":"e_1_2_1_44_1","volume-title":"Proceedings of the 6th International Conference on Extending Database Technology, (EDBT'98)","author":"Lin D.-I.","unstructured":"Lin , D.-I. and Kedem , Z . 1998. Pincer search: A new algorithm for discovering the maximum frequent set . In Proceedings of the 6th International Conference on Extending Database Technology, (EDBT'98) . Valencia, Spain, 385--392.]] Lin, D.-I. and Kedem, Z. 1998. Pincer search: A new algorithm for discovering the maximum frequent set. In Proceedings of the 6th International Conference on Extending Database Technology, (EDBT'98). Valencia, Spain, 385--392.]]"},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the 14th International Conference on Data Engineering","author":"Lin J. L.","unstructured":"Lin , J. L. and Dunham , M. H . 1998. Mining association rules: Anti skew algorithms . In Proceedings of the 14th International Conference on Data Engineering . Orlando, FL, IEEE Computer Society Press, 486--493.]] Lin, J. L. and Dunham, M. H. 1998. Mining association rules: Anti skew algorithms. In Proceedings of the 14th International Conference on Data Engineering. Orlando, FL, IEEE Computer Society Press, 486--493.]]"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312216"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775081"},{"key":"e_1_2_1_48_1","volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03)","volume":"90","author":"Lucchese C.","unstructured":"Lucchese , C. , Orlando , S. , Palmerini , P. , Perego , R. , and Silvestri , F . 2003. kDCI: A multi-strategy algorithm for mining frequent sets . In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03) , Melbourne, FL B. Goethals and M. J. Zaki, Eds. Vol. 90 . IEEE Press.]] Lucchese, C., Orlando, S., Palmerini, P., Perego, R., and Silvestri, F. 2003. kDCI: A multi-strategy algorithm for mining frequent sets. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), Melbourne, FL B. Goethals and M. J. Zaki, Eds. Vol. 90. IEEE Press.]]"},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the AAAI Workshop on Knowledge Discovery in Databases","author":"Mannila H.","year":"1994","unstructured":"Mannila , H. , Toivonen , H. , and Verkamo , A, I . 1994 . Efficient algorithms for discovering association rules . In Proceedings of the AAAI Workshop on Knowledge Discovery in Databases , Seattle, WA, M. Fayyad, U and R. Uthurusamy, Eds, 181--192.]] Mannila, H., Toivonen, H., and Verkamo, A, I. 1994. Efficient algorithms for discovering association rules. In Proceedings of the AAAI Workshop on Knowledge Discovery in Databases, Seattle, WA, M. Fayyad, U and R. Uthurusamy, Eds, 181--192.]]"},{"key":"e_1_2_1_50_1","volume-title":"Department of Computer Science","author":"Mueller A.","unstructured":"Mueller , A. 1995. Fast sequential and parallel algorithms for association rule mining: a comparison. Tech. rep. CS-TR-3515 , Department of Computer Science , University of MaryLand , College Park, MD .]] Mueller, A. 1995. Fast sequential and parallel algorithms for association rule mining: a comparison. Tech. rep. CS-TR-3515, Department of Computer Science, University of MaryLand, College Park, MD.]]"},{"key":"e_1_2_1_51_1","volume-title":"DCI: A hybrid algorithm for frequent itemset counting. Tech. rep. CS-01-9-2001, Dipartimento. di Informatica, Universita Ca Foscari.]]","author":"Orlando S.","year":"2001","unstructured":"Orlando , S. , Palmerini , P. , and Perego , R . 2001 a. DCI: A hybrid algorithm for frequent itemset counting. Tech. rep. CS-01-9-2001, Dipartimento. di Informatica, Universita Ca Foscari.]] Orlando, S., Palmerini, P., and Perego, R. 2001a. DCI: A hybrid algorithm for frequent itemset counting. Tech. rep. CS-01-9-2001, Dipartimento. di Informatica, Universita Ca Foscari.]]"},{"key":"e_1_2_1_52_1","volume-title":"Proceedings of the International Conference on Data Warehousing and Knowledge Discovery","author":"Orlando S.","unstructured":"Orlando , S. , Palmerini , P. , and Perego , R . 2001b. Enhancing the Apriori algorithm for frequent set counting . In Proceedings of the International Conference on Data Warehousing and Knowledge Discovery , Munich, Germany, Y. Kambayashi, W. Winiwarter, and M. Arikawa, Eds. Springer, Berlin, Germany, 71--82.]] Orlando, S., Palmerini, P., and Perego, R. 2001b. Enhancing the Apriori algorithm for frequent set counting. In Proceedings of the International Conference on Data Warehousing and Knowledge Discovery, Munich, Germany, Y. Kambayashi, W. Winiwarter, and M. Arikawa, Eds. Springer, Berlin, Germany, 71--82.]]"},{"key":"e_1_2_1_53_1","volume-title":"10th Turkish Symposium on Artificial Intelligence and Neural Networks, Gazimagusa, T.R.N.C., A. Acan, I. Aybay, and M. Salamah, Eds. Springer","author":"Ozel S. A.","unstructured":"Ozel , S. A. and Guvenir , H. A . 2001. An algorithm for mining association rules using perfect hashing and database pruning . In 10th Turkish Symposium on Artificial Intelligence and Neural Networks, Gazimagusa, T.R.N.C., A. Acan, I. Aybay, and M. Salamah, Eds. Springer , Berlin, Germany, 257--264.]] Ozel, S. A. and Guvenir, H. A. 2001. An algorithm for mining association rules using perfect hashing and database pruning. In 10th Turkish Symposium on Artificial Intelligence and Neural Networks, Gazimagusa, T.R.N.C., A. Acan, I. Aybay, and M. Salamah, Eds. Springer, Berlin, Germany, 257--264.]]"},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD-98)","author":"Padmanabhan B.","unstructured":"Padmanabhan , B. and Tuzhilin , A . 1998. A belief driven method for discovering unexpected patterns . In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD-98) New York, NY. AAAI Press, 94--100.]] Padmanabhan, B. and Tuzhilin, A. 1998. A belief driven method for discovering unexpected patterns. In Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining (KDD-98) New York, NY. AAAI Press, 94--100.]]"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347103"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.634757"},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the 15th Conference on Advanced Databases. Springer","author":"Pasquier N.","unstructured":"Pasquier , N. , Bastide , Y. , Taouil , R. , and Lakhal , L . 1999a. Closed set based discovery of small covers for association rules . In Proceedings of the 15th Conference on Advanced Databases. Springer . Bordeaux, France, 361--381.]] Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. 1999a. Closed set based discovery of small covers for association rules. In Proceedings of the 15th Conference on Advanced Databases. Springer. Bordeaux, France, 361--381.]]"},{"key":"e_1_2_1_58_1","volume-title":"Proceedings of the 7th International Conference on Database Theory (ICDT'99)","author":"Pasquier N.","unstructured":"Pasquier , N. , Bastide , Y. , Taouil , R. , and Lakhal , L . 1999b. Discovering frequent closed itemsets for association rules . In Proceedings of the 7th International Conference on Database Theory (ICDT'99) . Jerusalem, Israel, Springer, Berlin, Germany, 398--416.]] Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. 1999b. Discovering frequent closed itemsets for association rules. In Proceedings of the 7th International Conference on Database Theory (ICDT'99). Jerusalem, Israel, Springer, Berlin, Germany, 398--416.]]"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the 17th International Conference on Data Engineering (ICDE'01)","author":"Pei J.","unstructured":"Pei , J. , Han , J. , and Lakshmanan , L. V. S. 2001. Mining frequent itemsets with convertible constraints . In Proceedings of the 17th International Conference on Data Engineering (ICDE'01) . Heidelberg, Germany. IEEE Computer Society Press, 433--442.]] Pei, J., Han, J., and Lakshmanan, L. V. S. 2001. Mining frequent itemsets with convertible constraints. In Proceedings of the 17th International Conference on Data Engineering (ICDE'01). Heidelberg, Germany. IEEE Computer Society Press, 433--442.]]"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.336572"},{"key":"e_1_2_1_62_1","volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03)","author":"Pietracaprina A.","unstructured":"Pietracaprina , A. and Zandolin , D . 2003. Mining frequent itemsets using patricia tries . In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03) , Melbourne, FL, B. Goethals and M. J. Zaki, Eds.]] Pietracaprina, A. and Zandolin, D. 2003. Mining frequent itemsets using patricia tries. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), Melbourne, FL, B. Goethals and M. J. Zaki, Eds.]]"},{"key":"e_1_2_1_63_1","volume-title":"11th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC'99)","author":"Pijls W.","unstructured":"Pijls , W. and Bioch , J. C . 1999. Mining frequent itemsets in memory resident databases . In 11th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC'99) , Kasteel Vaeshartelt, Maastricht, The Netherlands. E. Postma and M. Gyssens, Eds. Springer, Berlin, Germany, 75--82.]] Pijls, W. and Bioch, J. C. 1999. Mining frequent itemsets in memory resident databases. In 11th Belgium-Netherlands Conference on Artificial Intelligence (BNAIC'99), Kasteel Vaeshartelt, Maastricht, The Netherlands. E. Postma and M. Gyssens, Eds. Springer, Berlin, Germany, 75--82.]]"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/507533.507535"},{"key":"e_1_2_1_65_1","volume-title":"Proceedings of the 3rd International Conference on the Principles of Knowledge Representation and Reasoning","author":"Rymon R.","year":"1992","unstructured":"Rymon , R. 1992 . Search through systematic set enumeration . In Proceedings of the 3rd International Conference on the Principles of Knowledge Representation and Reasoning . Cambridge, MA. Morgan Kaufmann, 539--550.]] Rymon, R. 1992. Search through systematic set enumeration. In Proceedings of the 3rd International Conference on the Principles of Knowledge Representation and Reasoning. Cambridge, MA. Morgan Kaufmann, 539--550.]]"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/312129.312272"},{"key":"e_1_2_1_67_1","volume-title":"Proceedings of the 21st International Conference on Very Large Data Bases, (VLDB'95)","author":"Savasere A.","unstructured":"Savasere , A. , Omiecinski , E. , and Navathe , S . 1995. An efficient algorithm for mining association rules in large databases . In Proceedings of the 21st International Conference on Very Large Data Bases, (VLDB'95) , Zurich, Switzerland. U. Dayal, P. M. D. Gray, and S. Nishio, Eds. Morgan Kaufmann, 432--444.]] Savasere, A., Omiecinski, E., and Navathe, S. 1995. An efficient algorithm for mining association rules in large databases. In Proceedings of the 21st International Conference on Very Large Data Bases, (VLDB'95), Zurich, Switzerland. U. Dayal, P. M. D. Gray, and S. Nishio, Eds. Morgan Kaufmann, 432--444.]]"},{"key":"e_1_2_1_68_1","volume-title":"Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery","author":"Shah D.","unstructured":"Shah , D. , Lakshmanan , L. V. S. , Ramamritham , K. , and Sudarshan , S . 1999. Interestingness and pruning of mined patterns . In Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery , Philadelphia, PA. K. Shim and R. Srikant, Eds. ACM Press.]] Shah, D., Lakshmanan, L. V. S., Ramamritham, K., and Sudarshan, S. 1999. Interestingness and pruning of mined patterns. In Proceedings of the ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Philadelphia, PA. K. Shim and R. Srikant, Eds. ACM Press.]]"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335376"},{"key":"e_1_2_1_70_1","volume-title":"Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining (KDD-95)","author":"Silberschatz A.","unstructured":"Silberschatz , A. and Tuzhilin , A . 1995. On subjective measures of interestingness in knowledge discovery . In Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining (KDD-95) , Montreal, Quebec, Canada. U. M. Fayyad and R. Uthurusamy, Eds. AAAI Press, Menlo Park, CA, 275--281.]] Silberschatz, A. and Tuzhilin, A. 1995. On subjective measures of interestingness in knowledge discovery. In Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining (KDD-95), Montreal, Quebec, Canada. U. M. Fayyad and R. Uthurusamy, Eds. AAAI Press, Menlo Park, CA, 275--281.]]"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.553165"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233311"},{"key":"e_1_2_1_73_1","volume-title":"Proceedings of the 14th Australasian Database Conference. K. Dieter-Schewe and X. Zhou, Eds. CRPIT","volume":"25","author":"Sucahyo Y. G.","unstructured":"Sucahyo , Y. G. and Gopalan , R. P . 2003. CT-ITL: Efficient frequent item set mining using a compressed prefix tree with pattern growth . In Proceedings of the 14th Australasian Database Conference. K. Dieter-Schewe and X. Zhou, Eds. CRPIT , vol. 25 . Australian Computer Society Inc., Adelaide, Australia, 95--105.]] Sucahyo, Y. G. and Gopalan, R. P. 2003. CT-ITL: Efficient frequent item set mining using a compressed prefix tree with pattern growth. In Proceedings of the 14th Australasian Database Conference. K. Dieter-Schewe and X. Zhou, Eds. CRPIT, vol. 25. Australian Computer Society Inc., Adelaide, Australia, 95--105.]]"},{"key":"e_1_2_1_74_1","volume-title":"22nd International Conference on Very Large Data Bases, (VLDB'96)","author":"Toivonen H.","year":"1996","unstructured":"Toivonen , H. 1996 . Sampling large databases for association rules . In 22nd International Conference on Very Large Data Bases, (VLDB'96) , Mumbai (Bombay), India. T. Vijayaraman, P. Buchmann, C. Mohan, and N. Sarda, Eds. Morgan Kaufmann, 134--141.]] Toivonen, H. 1996. Sampling large databases for association rules. In 22nd International Conference on Very Large Data Bases, (VLDB'96), Mumbai (Bombay), India. T. Vijayaraman, P. Buchmann, C. Mohan, and N. Sarda, Eds. Morgan Kaufmann, 134--141.]]"},{"key":"e_1_2_1_75_1","volume-title":"ECML'95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases","author":"Toivonen H.","unstructured":"Toivonen , H. , Klemettinen , M. , Ronkainen , P. , Hatonen , K. , and Mannila , H . 1995. Pruning and grouping of discovered association rules . ECML'95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases . Heraklion, Greece, 47--52.]] Toivonen, H., Klemettinen, M., Ronkainen, P., Hatonen, K., and Mannila, H. 1995. Pruning and grouping of discovered association rules. ECML'95 Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases. Heraklion, Greece, 47--52.]]"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956779"},{"key":"e_1_2_1_77_1","volume-title":"Proceedings of the 6th Pacific Asia Conference on Knowledge Discovery and Data Mining, (PAKDD'02)","volume":"2336","author":"Wang K.","unstructured":"Wang , K. , Tang , L. , Han , J. , and Liu , J . 2002. Top down FP-growth for association rule mining . In Proceedings of the 6th Pacific Asia Conference on Knowledge Discovery and Data Mining, (PAKDD'02) , Taipei, Taiwan. B. L. Ming-Shan Cheng, Philip S. Yu, Eds. Vol. 2336 . Springer, Berlin, Germany, 334--340.]] Wang, K., Tang, L., Han, J., and Liu, J. 2002. Top down FP-growth for association rule mining. In Proceedings of the 6th Pacific Asia Conference on Knowledge Discovery and Data Mining, (PAKDD'02), Taipei, Taiwan. B. L. Ming-Shan Cheng, Philip S. Yu, Eds. Vol. 2336. Springer, Berlin, Germany, 334--340.]]"},{"key":"e_1_2_1_78_1","volume-title":"Proceedings of the IEEE\/ACM International Conference on Parallel and Distributed Information Systems. ACM Press, 8--18","author":"Yen S. J.","unstructured":"Yen , S. J. and Chen , A. L. P. 1996. An efficient approach to knowledge discovery from large databases . In Proceedings of the IEEE\/ACM International Conference on Parallel and Distributed Information Systems. ACM Press, 8--18 .]] Yen, S. J. and Chen, A. L. P. 1996. An efficient approach to knowledge discovery from large databases. In Proceedings of the IEEE\/ACM International Conference on Parallel and Distributed Information Systems. ACM Press, 8--18.]]"},{"key":"e_1_2_1_79_1","volume-title":"Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03)","author":"Za\u00efane O. R.","unstructured":"Za\u00efane , O. R. and El-Hajj , M . 2003. Cofi-tree mining: A new approach to pattern growth with reduced candidacy generation . In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03) , Melbourne, FL. B. Goethals and M. J. Zaki, Eds.]] Za\u00efane, O. R. and El-Hajj, M. 2003. Cofi-tree mining: A new approach to pattern growth with reduced candidacy generation. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI'03), Melbourne, FL. B. Goethals and M. J. Zaki, Eds.]]"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/4434.806975"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"e_1_2_1_82_1","volume-title":"SPADE: An efficient algorithm for mining frequent sequences. Machine Learn. 42, 1\/2, 31--60.]]","author":"Zaki M. J.","year":"2001","unstructured":"Zaki , M. J. 2001 . SPADE: An efficient algorithm for mining frequent sequences. Machine Learn. 42, 1\/2, 31--60.]] Zaki, M. J. 2001. SPADE: An efficient algorithm for mining frequent sequences. Machine Learn. 42, 1\/2, 31--60.]]"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000040429.96086.c7"},{"key":"e_1_2_1_84_1","volume-title":"-J","author":"Zaki M. J.","year":"2002","unstructured":"Zaki , M. J. and Hsiao , C . -J . 2002 . CHARM : An efficient algorithm for closed itemset mining. In Proceedings of the 2nd SIAM International Conference on Data Mining (SDM'02), Arlington, VA. R. L. Grossman, J. Han, V. Kumar, H. Mannila, and R. Motwani, Eds. SIAM, 457--473.]] Zaki, M. J. and Hsiao, C.-J. 2002. CHARM: An efficient algorithm for closed itemset mining. In Proceedings of the 2nd SIAM International Conference on Data Mining (SDM'02), Arlington, VA. R. L. Grossman, J. Han, V. Kumar, H. Mannila, and R. Motwani, Eds. SIAM, 457--473.]]"},{"key":"e_1_2_1_85_1","volume-title":"3rd International Conference on Knowledge Discovery and Data Mining (KDD'97)","author":"Zaki M. J.","unstructured":"Zaki , M. J. , Parthasarathy , S. , Ogihara , M. , and Li , W . 1997. New algorithms for fast discovery of association rules . In 3rd International Conference on Knowledge Discovery and Data Mining (KDD'97) . Newport Beach, CA. AAAI Press, 283--286.]] Zaki, M. J., Parthasarathy, S., Ogihara, M., and Li, W. 1997. New algorithms for fast discovery of association rules. In 3rd International Conference on Knowledge Discovery and Data Mining (KDD'97). Newport Beach, CA. AAAI Press, 283--286.]]"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132956.1132958","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132956.1132958","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:13Z","timestamp":1750259173000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132956.1132958"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,25]]},"references-count":85,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,7,25]]}},"alternative-id":["10.1145\/1132956.1132958"],"URL":"https:\/\/doi.org\/10.1145\/1132956.1132958","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,25]]},"assertion":[{"value":"2006-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}