article

Association mining

Authors:

John F. RoddickAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 38, Issue 2

Pages 5 - es

https://doi.org/10.1145/1132956.1132958

Published: 25 July 2006 Publication History

Abstract

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.

References

[1]

Agrawal, R., Imielinski, T., and Swami, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD International Conference on the Management of Data. Washington DC, P. Buneman and S. Jajodia, Eds. ACM Press, 207--216.]]

Digital Library

[2]

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.]]

Digital Library

[3]

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.]]

[4]

Agrawal, R. C., Aggarwal, C. C., and Prasad, V. V. V. 2000. Depth first generation of long patterns. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Boston, MA. ACM Press, 108--118.]]

Digital Library

[5]

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.]]

[6]

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.]]

Digital Library

[7]

Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., and Lakhal, L. 2000. Mining frequent patterns with counting inference. SIGKDD Explorations 2, 2, 66--75.]]

Digital Library

[8]

Bayardo Jr, R. 1998. Efficiently mining long patterns from databases. ACM SIGMOD International Conference on the Management of Data (SIGMOD'98). Seattle, WA, ACM Press, 85--93.]]

Digital Library

[9]

Bayardo Jr, R. and Agrawal, R. 1999. Mining the most interesting rules. In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining San Diego, CA, S. Chaudhuri and D. Madigan, Eds. ACM Press, 145--154.]]

Digital Library

[10]

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.]]

[11]

Boulicant, J.-F., Bykowski, A., and Rigotti, C. 2001. Free-sets: A condensed representation of boolean data for the approximation of frequency queries. Data Mining Know. Discov. 7, 1, 5--22.]]

Digital Library

[12]

Brin, S., Motwani, R., Ullman, J. D., and Tsur, S. 1997. Dynamic itemset counting and implication rules for market basket data. SIGMOD Record 26, 2, 255--276.]]

Digital Library

[13]

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.]]

Digital Library

[14]

Bykowski, A. and Rigotti, C. 2001. A condensed representation to find frequent patterns. In Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on the Principles of Database Systems, Santa Barbara, CA. ACM Press, 267--273.]]

Digital Library

[15]

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.]]

Digital Library

[16]

Chen, B., Haas, P., and Scheuermann, P. 2002. A new two-phase sampling based algorithm for discovering association rules. In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Edmonton, Alberta, Canada, ACM Press, 462--468.]]

Digital Library

[17]

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.]]

Digital Library

[18]

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.]]

Digital Library

[19]

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.]]

[20]

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.]]

Digital Library

[21]

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.]]

Digital Library

[22]

Freitas, A. 1999. On rule interestingness measures. Knowl. Based Syst. 12, 5--6, 309--315.]]

Digital Library

[23]

Ganter, G. and Wille, R. 1999. Formal Concept Analysis: Mathematical Foundations. Springer, Berlin, Germany.]]

Digital Library

[24]

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.]]

[25]

Gibbons, P. 2001. Distinct sampling for highly-accurate answers to distinct values queries and event reports. In Proceedings of the 27th International Conference on Very Large Data Bases (VLDB'01), Rome, Italy. Morgan Kaufmann, 541--550.]]

Digital Library

[26]

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.]]

[27]

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.]]

[28]

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.]]

Digital Library

[29]

Goulbourne, G., Coenen, F., and Leng, P. 2000. Algorithms for computing association rules using a partial support tree. Knowl. Based Syst. 13, 2--3, 141--149.]]

Digital Library

[30]

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.]]

[31]

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.]]

[32]

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.]]

Digital Library

[33]

Han, J. and Pei, J. 2000. Mining frequent patterns by pattern growth: Methodology and implications. SIGKDD Explorations 2, 2, 14--20.]]

Digital Library

[34]

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.]]

Digital Library

[35]

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.]]

Digital Library

[36]

Hipp, J., Güntzer, U., and Nakhaeizadeh, G. 2000a. Algorithms for association rule mining---a general survey and comparison. SIGKDD Explorations 2, 1, 58--65.]]

Digital Library

[37]

Hipp, J., Güntzer, U., and Nakhaeizadeh, G. 2000b. Mining association rules: Deriving a superior algorithm by analysing today's approaches. In Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery (PKDD'00), Lyon, France. D. Zighed, J. Komorowski, and J. Zytkow, Eds. LNAI, vol. 1910. Springer, Berlin, Germany, 159--168.]]

Digital Library

[38]

Houtsma, M. and Swami, A. 1993. Set oriented mining of association rules. Tech. rep. RJ 9567, IBM Almaden Research Centre.]]

[39]

Kivinen, M. and Mannila, H. 1994. The power of sampling in knowledge discovery. In Proceedings of the 13th ACM SIGACT-SIGMOD-SIGART Symposium on the Principles of Database Systems (PODS'94). Minneapolis, NM, ACM Press, 77--85.]]

Digital Library

[40]

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.]]

[41]

Kryszkiewicz, M. 1998. Fast discovery of representative association rules. In Proceedings of the Rough Sets and Current Trends in Computing, 1st International Conference, (RSCTC'98), Warsaw, Poland, L. Polkowski and A. Skowron, Eds. Lecture Notes in Computer Science, vol. 1424. Springer, Berlin, Germany, 214--221.]]

Digital Library

[42]

Kryszkiewicz, M. 2002. Concise representations of association rules. ESF Exploratory Workshop on Pattern Detection and Discovery. London, UK, Springer, Berlin, Germany. 92--109.]]

Digital Library

[43]

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.]]

[44]

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.]]

Digital Library

[45]

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.]]

Digital Library

[46]

Liu, B., Hsu, W., and Ma, Y. 1999. Pruning and summarizing the discovered rules. In Proceedings of the 5th ACM SIGMOD Conference on Data Mining and Knowledge Discovery.]]

Digital Library

[47]

Liu, J., Pan, Y., Wang, K., and Han, J. 2002. Mining frequent item sets by opportunistic projection. In Proceedings of the Knowledge Discovery in Databases. Edmonton, Canada, Vol. 31. ACM Press, 97--102.]]

Digital Library

[48]

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.]]

[49]

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.]]

[50]

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.]]

Digital Library

[51]

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.]]

[52]

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.]]

Digital Library

[53]

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.]]

[54]

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.]]

[55]

Padmanabhan, B. and Tuzhilin, A. 2000. Small is beautiful: Discovering the minimal set of unexpected patterns. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Boston, MA. R. Ramakrishnan, S. Stolfo, R. Bayardo, and I. Parsa, Eds. ACM Press, 54--63.]]

Digital Library

[56]

Park, J. S., Chen, M. S., and Yu, P. S. 1997. Using a hash-based method with transaction trimming and database scan reduction for mining association rules. IEEE Trans. Knowl. Data Eng. 9, 5, 813--825.]]

Digital Library

[57]

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.]]

[58]

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.]]

Digital Library

[59]

Pasquier, N., Bastide, Y., Taouil, R., and Lakhal, L. 1999c. Efficient mining of association rules using closed itemset lattices. Informa. Syst. 24, 1, 25--46.]]

Digital Library

[60]

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.]]

Digital Library

[61]

Pei, J., Mao, R., Hu, K., and Zhu, H. 2000. Towards data mining benchmarking: a test bed for performance study of frequent pattern mining. In ACM SIGMOD International Conference on the Management of Data (SIGMOD'00), Dallas, TX. W. Chen, J. Naughton, and P. A. Bernstein, Eds. ACM Press, 592.]]

Digital Library

[62]

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.]]

[63]

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.]]

[64]

Roddick, J. F. and Rice, S. P. 2001. What's interesting about cricket&quest;---on thresholds and anticipation in discovered rules. SIGKDD Explorations 3, 1, 1--5.]]

Digital Library

[65]

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.]]

[66]

Sahar, S. 1999. Interestingness via what is not interesting. In Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining, San Diego, CA. S. Chaudhuri and D. Madigan, Eds. ACM Press, 332--336.]]

Digital Library

[67]

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.]]

Digital Library

[68]

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.]]

[69]

Shenoy, P., Haritsa, J. R., Sudarshan, S., Bhalotia, G., Bawa, M., and Shah, D. 2000. Turbo-charging vertical mining of large databases. In Proceedings of the 2000 ACM SIGKDD International Conference on Management of Data Dallas TX. W. Chen, J. Naughton, and P. A. Bernstein, Eds. Vol. 29. ACM Press, 22--33.]]

Digital Library

[70]

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.]]

[71]

Silberschatz, A. and Tuzhilin, A. 1996. What makes patterns interesting in knowledge discovery systems&quest; IEEE Trans. Knowl. Data Eng. 8, 6, 970--974.]]

Digital Library

[72]

Srikant, R. and Agrawal, R. 1996. Mining quantitative association rules in large relational tables. In Proceedings of the ACM SIGMOD International Conference on the Management of Data, Montreal, Canada. H. V. Jagadish and B. Mumick, Eds. 1--12.]]

Digital Library

[73]

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.]]

Digital Library

[74]

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.]]

Digital Library

[75]

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.]]

[76]

Wang, J., Han, J., and Pei, J. 2003. CLOSET+: Searching for the best strategies for mining frequent closed itemsets. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC. L. Getoor, T. E. Senator, P. Domingos, and C. Faloutsos, Eds. ACM Press, 236--245.]]

Digital Library

[77]

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.]]

Digital Library

[78]

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.]]

Digital Library

[79]

Zaïane, 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.]]

[80]

Zaki, M. J. 1999. Parallel and distributed association mining: A survey. IEEE Concurrency (Special Issue on Parallel Mechanisms for Data Mining.) 7, 4, 14--25.]]

Digital Library

[81]

Zaki, M. J. 2000. Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12, 3, 372--390.]]

Digital Library

[82]

Zaki, M. J. 2001. SPADE: An efficient algorithm for mining frequent sequences. Machine Learn. 42, 1/2, 31--60.]]

[83]

Zaki, M. J. 2004. Mining non-redundant association rules. Data Mining Knowl. Disco. 9, 3, 223--248.]]

Digital Library

[84]

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.]]

[85]

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.]]

Cited By

Wang YWu JWu ZAdomavicius G(2024)Efficient and Flexible Long-Tail Recommendation Using Cosine PatternsINFORMS Journal on Computing10.1287/ijoc.2022.0194Online publication date: 10-May-2024
https://doi.org/10.1287/ijoc.2022.0194
Kuch MWöllner C(2024)Effects of mobile music listening: Patterns of changes in focus of attention, environmental perception, and self-experienceMusicae Scientiae10.1177/1029864924124942728:4(740-757)Online publication date: 17-May-2024
https://doi.org/10.1177/10298649241249427
Mazumdar NSarma P(2024)Sequential pattern mining algorithms and their applications: a technical reviewInternational Journal of Data Science and Analytics10.1007/s41060-024-00659-xOnline publication date: 5-Oct-2024
https://doi.org/10.1007/s41060-024-00659-x
Show More Cited By

Index Terms

Association mining
1. Information systems
  1. Data management systems
    1. Database management system engines
  2. Information retrieval
    1. Retrieval models and ranking

Recommendations

A novel Boolean algebraic framework for association and pattern mining

Data mining has been defined as the non- trivial extraction of implicit, previously unknown and potentially useful information from data. Association mining and sequential mining analysis are considered as crucial components of strategic control over a ...
A Boolean algebraic framework for association and pattern mining
ICCOMP'08: Proceedings of the 12th WSEAS international conference on Computers

Data mining and sequential mining analysis are considered as crucial components of strategic control over a broad variety of disciplines in business, science and engineering. Data mining has been defined as the non- trivial extraction of implicit, ...
Re-mining item associations: Methodology and a case study in apparel retailing

Association mining is the conventional data mining technique for analyzing market basket data and it reveals the positive and negative associations between items. While being an integral part of transaction data, pricing and time information have not ...

Comments

Information & Contributors

Information

Published In

cover image ACM Computing Surveys

ACM Computing Surveys Volume 38, Issue 2

2006

145 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/1132956

Issue’s Table of Contents

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2006

Published in CSUR Volume 38, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

209
Total Citations
View Citations
7,528
Total Downloads

Downloads (Last 12 months)33
Downloads (Last 6 weeks)6

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wang YWu JWu ZAdomavicius G(2024)Efficient and Flexible Long-Tail Recommendation Using Cosine PatternsINFORMS Journal on Computing10.1287/ijoc.2022.0194Online publication date: 10-May-2024
https://doi.org/10.1287/ijoc.2022.0194
Kuch MWöllner C(2024)Effects of mobile music listening: Patterns of changes in focus of attention, environmental perception, and self-experienceMusicae Scientiae10.1177/1029864924124942728:4(740-757)Online publication date: 17-May-2024
https://doi.org/10.1177/10298649241249427
Mazumdar NSarma P(2024)Sequential pattern mining algorithms and their applications: a technical reviewInternational Journal of Data Science and Analytics10.1007/s41060-024-00659-xOnline publication date: 5-Oct-2024
https://doi.org/10.1007/s41060-024-00659-x
Bhakuni PDas A(2024)Leveraging Data Mining Techniques to Render Unprecedented Opportunities for Business Organizations to Survive and Thrive in the Course of COVID-19Analytical Decision Making and Data Envelopment Analysis10.1007/978-981-97-6972-8_14(295-318)Online publication date: 29-Oct-2024
https://doi.org/10.1007/978-981-97-6972-8_14
Bouaita BBeghriche AKout AMoussaoui A(2023)A New Approach for Optimizing the Extraction of Association RulesEngineering, Technology & Applied Science Research10.48084/etasr.572213:2(10496-10500)Online publication date: 2-Apr-2023
https://doi.org/10.48084/etasr.5722
Petry FYager R(2023)Data Mining Using Association Rules for Intuitionistic Fuzzy DataInformation10.3390/info1407037214:7(372)Online publication date: 29-Jun-2023
https://doi.org/10.3390/info14070372
SAKAI HNAKATA M(2023)Missing Value Imputation and an Attempt Toward Machine Learning by Rule Generation in Rough Set Non-Deterministic Information Analysisラフ集合非決定情報解析における欠損値補完とルール生成による機械学習に向けた試みJournal of Japan Society for Fuzzy Theory and Intelligent Informatics10.3156/jsoft.35.4_74635:4(746-758)Online publication date: 15-Nov-2023
https://doi.org/10.3156/jsoft.35.4_746
Suzuki RFukuta N(2023)Prototyping an Agent for Dynamic Generation of Attack-Payloads in Web Application Vulnerability Assessment2023 15th International Congress on Advanced Applied Informatics Winter (IIAI-AAI-Winter)10.1109/IIAI-AAI-Winter61682.2023.00016(37-44)Online publication date: 11-Dec-2023
https://doi.org/10.1109/IIAI-AAI-Winter61682.2023.00016
Toivonen H(2023)Frequent PatternEncyclopedia of Machine Learning and Data Science10.1007/978-1-4899-7502-7_106-1(1-6)Online publication date: 12-Apr-2023
https://doi.org/10.1007/978-1-4899-7502-7_106-1
Leung C(2022)Big Data Visualization of Association Rules and Frequent PatternsEncyclopedia of Data Science and Machine Learning10.4018/978-1-7998-9220-5.ch075(1284-1298)Online publication date: 14-Oct-2022
https://doi.org/10.4018/978-1-7998-9220-5.ch075
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents