Objective and Subjective Algorithms for Grouping Association Rules

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 an autometically tagged semantic tree-structured network of items. We provide a case study in which the proposed algorithms are evaluated. The results show that our grouping methods are effective and produce good grouping results.

• Type: Conference
• Year: 2003
• Where: ICDM
• Authors: Aijun An, Shakil M. Khan, Xiangji Huang
• Keywords: Algorithms, Association Rules, Data Mining, ICDM 2003, first Algorithm