Advertisement

Association Rules and Sequential Patterns

  • Bing LiuEmail author
Chapter
Part of the Data-Centric Systems and Applications book series (DCSA)

Abstract

Association rules are an important class of regularities in data. Mining of association rules is a fundamental data mining task. It is perhaps the most important model invented and extensively studied by the database and data mining community. Its objective is to find all co-occurrence relationships, called associations, among data items. Since it was first introduced in 1993 by Agrawal et al. [2], it has attracted a great deal of attention. Many efficient algorithms, extensions and applications have been reported.

Keywords

Association Rule Sequential Pattern Minimum Support Frequent Itemsets Association Rule Mining 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. 1.
    Agarwal, R., C. Aggarwal, and V. Prasad. A tree projection algorithm for generation of frequent item sets. Journal of Parallel and Distributed Computing, 2001, 61(3): p. 350–371.zbMATHCrossRefGoogle Scholar
  2. 2.
    Agrawal, R., T. Imieliski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD International Conference on Management of Data (SIGMOD-1993), 1993.Google Scholar
  3. 3.
    Agrawal, R. and R. Srikant. Fast algorithms for mining association rules. In Proceedings of International Conference on Very Large Data Bases (VLDB-1994), 1994.Google Scholar
  4. 4.
    Agrawal, R. and R. Srikant. Mining sequential patterns. In Proceedings of IEEE International Conference on Data Engingeering (ICDE-1995), 1995.Google Scholar
  5. 5.
    Ayres, J., J. Flannick, J. Gehrke, and T. Yiu. Sequential pattern mining using a bitmap representation. In Proceedings of ACM SIGKDD International Google Scholar
  6. 6.
    Conference on Knowledge Discovery and Data Mining (KDD-2002), 2002.Google Scholar
  7. 7.
    Bayardo Jr, R. Efficiently mining long patterns from databases. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD-1998), 1998.Google Scholar
  8. 8.
    Bayardo Jr, R. and R. Agrawal. Mining the most interesting rules. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-1999), 1999.Google Scholar
  9. 9.
    Brin, S., R. Motwani, J. Ullman, and S. Tsur. Dynamic itemset counting and implication rules for market basket data. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD-1997), 1997.Google Scholar
  10. 10.
    Buehrer, G., S. Parthasarathy, and A. Ghoting. Out-of-core frequent pattern mining on a commodity PC. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2006), 2006.Google Scholar
  11. 11.
    Burdick, D., M. Calimlim, J. Flannick, J. Gehrke, and T. Yiu. Mafia: A maximal frequent itemset algorithm. Knowledge and Data Engineering, IEEE Transactions on, 2005, 17(11): p. 1490–1504.CrossRefGoogle Scholar
  12. 12.
    Cheung, D., S. Lee, and B. Kao. A general incremental technique for maintaining discovered association rules. In Proceedings of the Fifth International Conference on Database Systems for Advanced Applications (DASFAA-1997), 1997.Google Scholar
  13. 13.
    Cong, G., K. Tan, A. Tung, and X. Xu. Mining top-k covering rule groups for gene expression data. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD-2005), 2005.Google Scholar
  14. 14.
    Dong, G. and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-1999), 1999.Google Scholar
  15. 15.
    Dougherty, J., R. Kohavi, and M. Sahami. Supervised and unsupervised discretization of continuous features. In Proceedings of International Conference on Machine Learning (ICML-1995), 1995.Google Scholar
  16. 16.
    Han, J. and Y. Fu. Discovery of Multi-Level Association Rules from Large Databases. In Proceedings of International Conference on Very Large Data Bases (VLDB-1995), 1995.Google Scholar
  17. 17.
    Han, J., Y. Fu, W. Wang, K. Koperski, and O. Zaiane. DMQL: A data mining query language for relational databases. In Proceedings of 1996 ACM SIGMOD workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD-1996), 1996.Google Scholar
  18. 18.
    Han, J., J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of ACM SIGMOD Conference on Management of Data (SIGMOD-2000), 2000.Google Scholar
  19. 19.
    Imielinski, T. and A. Virmani. MSQL: A query language for database mining. Data Mining and Knowledge Discovery, 1999, 3(4): p. 373–408.CrossRefGoogle Scholar
  20. 20.
    Jindal, N. and B. Liu. Mining comparative sentences and relations. In Proceedings of National Conf. on Artificial Intelligence (AAAI-2006), 2006.Google Scholar
  21. 21.
    Klemettinen, M., H. Mannila, P. Ronkainen, H. Toivonen, and A. Verkamo. Finding interesting rules from large sets of discovered association rules. In Proceedings of ACM International Conference on Information and Knowledge Management (CIKM-1994), 1994.Google Scholar
  22. 22.
    Lin, D. and Z. Kedem. Pincer-search: A new algorithm for discovering the maximum frequent set. International Conference on Extended Database Technology (EDBT-1998), 1998: p. 103–119.Google Scholar
  23. 23.
    Liu, B., W. Hsu, and Y. Ma. Integrating classification and association rule mining. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-1998), 1998.Google Scholar
  24. 24.
    Liu, B., W. Hsu, and Y. Ma. Mining association rules with multiple minimum supports. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-1999), 1999.Google Scholar
  25. 25.
    Liu, B., W. Hsu, and Y. Ma. Pruning and summarizing the discovered associations. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-1999), 1999.Google Scholar
  26. 26.
    Liu, B., K. Zhao, J. Benkler, and W. Xiao. Rule interestingness analysis using OLAP operations. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2006), 2006.Google Scholar
  27. 27.
    Mannila, H., H. Toivonen, and A. Verkamo. Efficient algorithms for discovering association rules. In Proceedings of Knowledge Discovery in Databases (KDD'94), 1994.Google Scholar
  28. 28.
    Meo, R., G. Psaila, and S. Ceri. A new SQL-like operator for mining association rules. In Proceedings of International Conference on Very Large Data Bases (VLDB-1996), 1996.Google Scholar
  29. 29.
    Ng, R., L. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained associations rules. ACM SIGMOD Record, 1998, 27(2): p. 13–24.CrossRefGoogle Scholar
  30. 30.
    Ozden, B., S. Ramaswamy, and A. Silberschatz. Cyclic association rules. In Proceedings of IEEE International Conference on Data Engingeering (ICDE-2002), 2002.Google Scholar
  31. 31.
    Padmanabhan, B. and A. Tuzhilin. Small is beautiful: discovering the minimal set of unexpected patterns. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2000), 2000.Google Scholar
  32. 32.
    Park, J., M. Chen, and P. Yu. An effective hash-based algorithm for mining association rules. ACM SIGMOD Record, 1995, 24(2): p. 175–186.CrossRefGoogle Scholar
  33. 33.
    Pasquier, N., Y. Bastide, R. Taouil, and L. Lakhal. Discovering frequent closed itemsets for association rules. Database Theory—ICDT’99, 1999: p. 398–416.Google Scholar
  34. 34.
    Pei, J., J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proceedings of IEEE International Conference on Data Engingeering (ICDE-2001), 2001.Google Scholar
  35. 35.
    Piatetsky-Shapiro, G. Discovery, analysis, and presentation of strong rules. Knowledge discovery in databases, 1991.Google Scholar
  36. 36.
    Sarawagi, S., S. Thomas, and R. Agrawal. Integrating association rule mining with relational database systems: Alternatives and implications. Data Mining and Knowledge Discovery, 2000, 4(2): p. 89–125.CrossRefGoogle Scholar
  37. 37.
    Savasere, A., E. Omiecinski, and S. Navathe. Mining for strong negative associations in a large database of customer transactions. In Proceedings of IEEE International Conference on Data Engingeering (ICDE-1998), 1998.Google Scholar
  38. 38.
    Seno, M. and G. Karypis. Finding frequent patterns using length-decreasing support constraints. Data Mining and Knowledge Discovery, 2005, 10(3): p. 197–228.CrossRefMathSciNetGoogle Scholar
  39. 39.
    Silberschatz, A. and A. Tuzhilin. What makes patterns interesting in knowledge discovery systems. IEEE Transactions on Knowledge and Data Engineering, 1996, 8(6): p. 970–974.CrossRefGoogle Scholar
  40. 40.
    Srikant, R. and R. Agrawal. Mining generalized association rules. Future Generation Computer Systems, 1997, 13(2–3): p. 161–180.CrossRefGoogle Scholar
  41. 41.
    Srikant, R. and R. Agrawal. Mining quantitative association rules in large relational tables. ACM SIGMOD Record, 1996, 25(2): p. 1–12.CrossRefGoogle Scholar
  42. 42.
    Srikant, R. and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. Advances in Database Technology—EDBT'96, 1996: p. 1–17.Google Scholar
  43. 43.
    Srikant, R., Q. Vu, and R. Agrawal. Mining association rules with item constraints. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-1997), 1997.Google Scholar
  44. 44.
    Tan, P., V. Kumar, and J. Srivastava. Selecting the right interestingness measure for association patterns. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD- Google Scholar
  45. 45.
    2002), 2002.Google Scholar
  46. 46.
    Toivonen, H. Sampling large databases for association rules. In Proceedings of International Conference on Very Large Data Bases (VLDB-1996), 1996.Google Scholar
  47. 47.
    Tuzhilin, A. and B. Liu. Querying multiple sets of discovered rules. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2002), 2002.Google Scholar
  48. 48.
    Wang, J., J. Han, and J. Pei. Closet+: Searching for the best strategies for mining frequent closed itemsets. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003), 2003.Google Scholar
  49. 49.
    Wang, K., Y. He, and J. Han. Mining frequent itemsets using support constraints. In Proceedings of International Conference on Very Large Data Bases (VLDB-2000), 2000.Google Scholar
  50. 50.
    Wang, W., J. Yang, and P. Yu. WAR: weighted association rules for item intensities. Knowledge and Information systems, 2004, 6(2): p. 203–229.Google Scholar
  51. 51.
    Webb, G. Discovering associations with numeric variables. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2001), 2001.Google Scholar
  52. 52.
    Wu, X., C. Zhang, and S. Zhang. Efficient mining of both positive and negative association rules. ACM Transactions on Information Systems (TOIS), 2004, 22(3): p. 381–405.CrossRefGoogle Scholar
  53. 53.
    Xiong, H., P. Tan, and V. Kumar. Mining strong affinity association patterns in data sets with skewed support distribution. In Proceedings of IEEE International Conference on Data Mining (ICDM-2003), 2003.Google Scholar
  54. 54.
    Yang, J., W. Wang, and P. Yu. Mining surprising periodic patterns. Data Mining and Knowledge Discovery, 2004, 9(2): p. 189–216.CrossRefMathSciNetGoogle Scholar
  55. 55.
    Zaki, M. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning, 2001, 42(1): p. 31–60.zbMATHCrossRefGoogle Scholar
  56. 56.
    Zaki, M. and C. Hsiao. CHARM: An efficient algorithm for closed association rule mining. In Proceedings of SIAM International Conference on Data Mining (SDM-2002), 2002.Google Scholar
  57. 57.
    Zaki, M., S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In Proceedings of ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-1997), 1997.Google Scholar
  58. 58.
    Zheng, Z., R. Kohavi, and L. Mason. Real world performance of association rule algorithms. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2001), 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of Illinois, ChicagoChicagoUSA

Personalised recommendations