Sciweavers

DEXA
2004
Springer

A New Approach of Eliminating Redundant Association Rules

13 years 9 months ago
A New Approach of Eliminating Redundant Association Rules
Two important constraints of association rule mining algorithm are support and confidence. However, such constraints-based algorithms generally produce a large number of redundant rules. In many cases, if not all, number of redundant rules is larger than number of essential rules, consequently the novel intention behind association rule mining becomes vague. To retain the goal of association rule mining, we present several methods to eliminate redundant rules and to produce small number of rules from any given frequent or frequent closed itemsets generated. The experimental evaluation shows that the proposed methods eliminate significant number of redundant rules.
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where DEXA
Authors Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
Comments (0)