Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Mining association rules with multiple minimum supports
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient mining of both positive and negative association rules
ACM Transactions on Information Systems (TOIS)
Efficient association rule mining among infrequent items
Efficient association rule mining among infrequent items
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
Many existing association rule algorithms are based on the support-based pruning strategy to prune the combinatorial search space. This strategy is not effective for discovering interesting patterns, because low values of support generates too many rules, involving items with different support levels and poorly correlated, and high levels of support generates very few rules and generally trivial ones. In this paper we describe an algorithm to mining association rules with both rare and frequent items - MIRF algorithm. This algorithm does not require the minimum support to be specified in advance. Rather, it generates in each iteration all possible item sets, and extracts only those positively correlated in order to obtain a rule set whose size is smaller, easier to interpret and with both frequent and rare items. Also only the most relevant rule is extracted from each item set, which significantly reduces the time required for the mining process and the number of rules generated. Experimental evaluation of our algorithm on several databases will be presented.