Rare itemsets are likely to be of great interest because they often relate to high-impact transactions which may give rise to rules of great practical significance. Research into the rare association rule mining problem has gained momentum in the recent past. In this paper, we propose a novel approach that captures such rare rules while ensuring that redundant rules are eliminated. Extensive testing on real-world datasets from the UCI repository con_rm that our approach outperforms both the Apriori-Inverse(Koh et al. 2006) and Relative Support (Yun et al. 2003) algorithms. |
| Cite as: Koh, Y. S. and Pears, R. (2009). Non-Redundant Rare Itemset Generation. In Proc. Australasian Data Mining Conference (AusDM'09) Melbourne, Australia. CRPIT, 101. Kennedy P. J., Ong K. and Christen P. Eds., ACS. 69-74 |
 (from crpit.com)
(local if available)
|