RP-Tree: rare pattern tree mining

Authors:
Sidney Tsang;Yun Sing Koh;Gillian Dobbie
Affiliations:
The University of Auckland;The University of Auckland;The University of Auckland
Venue:
DaWaK'11 Proceedings of the 13th international conference on Data warehousing and knowledge discovery
Year:
2011

Citing 8
Cited 2

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Machine Learning

Machine Learning
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Rare Itemset Mining

ICMLA '07 Proceedings of the Sixth International Conference on Machine Learning and Applications
Towards Rare Itemset Mining

ICTAI '07 Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Association Mining in Large Databases: A Re-examination of Its Measures

PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
A Fast Algorithm for Mining Rare Itemsets

ISDA '09 Proceedings of the 2009 Ninth International Conference on Intelligent Systems Design and Applications
Finding sporadic rules using apriori-inverse

PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining

Rare pattern mining on data streams

DaWaK'12 Proceedings of the 14th international conference on Data Warehousing and Knowledge Discovery
A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets

Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most association rule mining techniques concentrate on finding frequent rules. However, rare association rules are in some cases more interesting than frequent association rules since rare rules represent unexpected or unknown associations. All current algorithms for rare association rule mining use an Apriori level-wise approach which has computationally expensive candidate generation and pruning steps. We propose RP-Tree, a method for mining a subset of rare association rules using a tree structure, and an information gain component that helps to identify the more interesting association rules. Empirical evaluation using a range of real world datasets shows that RP-Tree itemset and rule generation is more time efficient than modified versions of FP-Growth and ARIMA, and discovers 92-100% of all the interesting rare association rules.