Location of Repository

Concise representations for association rules in multi-level datasets

By Yue Xu, Gavin Shaw and Yuefeng Li

Abstract

Association rule mining has made many advances in the area of knowledge discovery. However, the quality of the discovered association rules is a big concern and has drawn more and more attention recently. One problem with the quality of the discovered association rules is the huge size of the extracted rule set. Often for a dataset, a huge number of rules can be extracted, but many of them can be redundant to other rules and thus useless in practice. Mining non-redundant rules is a promising approach to solve this problem. In this paper, we firstly propose a definition for redundancy; then we propose a concise representation called Reliable basis for representing non-redundant association rules for both exact rules and approximate rules. An important contribution of this paper is that we propose to use the certainty factor as the criteria to measure the strength of the discovered association rules. With the criteria, we can determine the boundary between redundancy and non-redundancy to ensure eliminating as many redundant rules as possible without reducing the inference capacity of and the belief to the remaining extracted non-redundant rules. We prove that the redundancy elimination based on the proposed Reliable basis does not reduce the belief to the extracted rules. We also prove that all association rules can be deduced from the Reliable basis. Therefore the Reliable basis is a lossless representation of association rules. Experimental results show that the proposed Reliable basis can significantly reduce the number of extracted rules.\u

Topics: 080700 LIBRARY AND INFORMATION STUDIES, Association rule mining, redundant association rules, closed itemsets, multi-level datasets
Publisher: Springer
Year: 2009
DOI identifier: 10.1007/s11518-009-5098-x
OAI identifier: oai:eprints.qut.edu.au:29770

Suggested articles

Preview


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.