Hierarchical grouping of association rules and its application to a real-world domain. (English) Zbl 1129.68461
Summary: One common problem in association rule mining is that often a very large number of rules are generated from the database. The sheer volume of these rules makes it difficult, if not impossible, for human users to analyze and make use of the rules. In this article, we propose two algorithms for grouping and summarizing association rules. The first algorithm recursively groups rules according to the structure of the rules and generates a tree of clusters as a result. The second algorithm groups the rules according to the semantic distance between the rules by making use of a semantic tree-structured network of items. We propose an algorithm for automatically tagging the semantic network so that the rules can be represented as directed line segments in a two-dimensional space and can then be grouped according to the distance between line segments. We also present an application of the two algorithms, in which the proposed algorithms are evaluated. The results show that our grouping methods are effective and produce good grouping results.
MSC:
| 68T05 | Learning and adaptive systems in artificial intelligence |
References:
| [1] | Adomavicius, G and Tuzhilin, A. 2001. Expert-driven validation of rule-based user models in personalization applications. Data Mining and Knowledge Discovery. January/April52001. · Zbl 1006.68629 |
| [2] | Agrawal, R, Imielinski, T and Swami, A. 1993. Mining associations between sets of items in massive databases. Proceedings of the ACM-SIGMOD 1993 International Conference on Management of Data. 1993, Washington, DC. pp.207–216. |
| [3] | Agrawal, R and Srikant, R. 1994. Fast algorithms for mining association rules. Proc. of the 20th International Conference on Very Large Databases. September1994, Santiago, Chile. |
| [4] | Blanchard, J, Guillet, F, Gras, R and Briand, H. 2005. Using information-theoretic measures to assess association rule interestingness. Proceedings of the 2005 IEEE International Conference on Data Mining (ICDM’05). 2005, New Orleans, Louisiana, USA. |
| [5] | Cristofor, L and Simovici, D. Generating an informative cover for association rules. Technical Report TR-02-01. Boston, MA: Department of Computer Science, University of Massachusetts at Boston. |
| [6] | Han, J, Pei, J and Yin, Y. 2000. Mining frequent patterns without candidate generation. Proc. of the 2000 ACM SIGMOD Int. Conf. on Management of Data (SIGMOD’00). 2000, Dallas, TX. |
| [7] | Hilderman, RJ and Hamilton, HJ. Knowledge discovery and interestingness measures: a survey. Tech. Report 99-4. pp.27Department of Computer Science, University of Regina. |
| [8] | Huang, X, An, A, Cercone, N and Promhouse, G. 2002. Discovery of interesting association rules from livelink web log data. Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM’02). 2002, Maebashi City, Japan. |
| [9] | Lent, B, Swami, A.N and Widom, J. 1997. Clustering association rules. Proceedings of International Conference on Data Engineering. 1997. |
| [10] | Liu, B, Hsu, W and Ma, Y. 1999. Pruning and summarizing the discovered associations. Proceedings of the fifth ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining. 1999, San Diego, CA. pp.125–134. |
| [11] | Pei, J, Han, J and Lakshmanan, L.V.S. 2001. Mining frequent itemsets with convertible constraints. Proceedings of the IEEE Int. Conf. on Data Eng. (ICDE’01). February2001, Heidelberg, Germany. |
| [12] | Piatetsky-Shapiro, G. 1991. Discovery, analysis and presentation of strong rules. Knowledge Discovery in Databases, AAAI. 1991. pp.229–248. |
| [13] | Sahar, S. 1999. Interestingness via what is not interesting. Proceedings of KDD’99. 1999. pp.332–336. |
| [14] | Savasere, A, Omiecinski, E and Navathe, S. 1995. An efficient algorithm for mining association rules in large databases. Proceedings of the 21st International Conference on Very Large Databases (VLDB’95). 1995, Zurich, Swizerland. pp.407–419. |
| [15] | Shah, D, Lakshmanan, L.V.S, Ramamritham, K and Sudarshan, S. 1999. Interestingness and pruning of mined patterns. ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery. May1999. |
| [16] | Srikant, R, Vu, Q and Agrawal, R. 1997. Mining association rules with item constraints. Proceedings of the Third International Conference on Knowledge Discovery in Databases. 1997, Newport Beach, CA. pp.67–73. |
| [17] | Tan, P and Kumar, V. Interestingness measures for association patterns: a perspective. Technical Report TR00-036. Department of Computer Science, University of Minnestota. |
| [18] | Toivonen, H, Klemettinen, M, Ronkainen, P, Hatonen, K and Mannila, H. Pruning and grouping discovered association rules. Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD’95). Montreal, Canada: AAAI Press. |
| [19] | Wang, K, Tay, S.H.W and Liu, B. 1998. Interestingness-based interval merger for numeric association rules. Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD’98). 1998. |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
