Hierarchical grouping of association rules and its application to a real-world domain

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.

[1]  Laks V. S. Lakshmanan,et al.  Mining frequent itemsets with convertible constraints , 2001, Proceedings 17th International Conference on Data Engineering.

[2]  Heikki Mannila,et al.  Pruning and grouping of discovered association rules , 1995 .

[3]  Xiangji Huang,et al.  Discovery of interesting association rules from Livelink web log data , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[4]  Wynne Hsu,et al.  Pruning and summarizing the discovered associations , 1999, KDD '99.

[5]  Gediminas Adomavicius,et al.  Expert-Driven Validation of Rule-Based User Models in Personalization Applications , 2004, Data Mining and Knowledge Discovery.

[6]  Ke Wang,et al.  Interestingness-Based Interval Merger for Numeric Association Rules , 1998, KDD.

[7]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[8]  Ramakrishnan Srikant,et al.  Mining Association Rules with Item Constraints , 1997, KDD.

[9]  Sigal Sahar,et al.  Interestingness via what is not interesting , 1999, KDD '99.

[10]  Pang-Ning Tan,et al.  Interestingness Measures for Association Patterns : A Perspective , 2000, KDD 2000.

[11]  Régis Gras,et al.  Using information-theoretic measures to assess association rule interestingness , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[12]  Dan A. Simovici,et al.  Generating an informative cover for association rules , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[13]  Gregory Piatetsky-Shapiro,et al.  Discovery, Analysis, and Presentation of Strong Rules , 1991, Knowledge Discovery in Databases.

[14]  Jennifer Widom,et al.  Clustering association rules , 1997, Proceedings 13th International Conference on Data Engineering.

[15]  Rakesh Agarwal,et al.  Fast Algorithms for Mining Association Rules , 1994, VLDB 1994.

[16]  Laks V. S. Lakshmanan,et al.  Interestingness and Pruning of Mined Patterns , 1999, 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery.

[17]  Shamkant B. Navathe,et al.  An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.