Finding Interesting Rare Association Rules Using Rare Pattern Tree

• Published in: Transactions on Large-Scale Data- and Knowledge-Centered Systems VIII Vol. 7790; pp. 157 - 173
• Main Authors: Tsang, Sidney, Koh, Yun Sing, Dobbie, Gillian
• Format: Book Chapter
• Language: English
• Published: Germany Springer Berlin / Heidelberg 2013; Springer Berlin Heidelberg
• Series: Lecture Notes in Computer Science
• Subjects: FP-Growth; Information Gain; Rare Pattern Mining
• ISBN: 3642375731; 9783642375736
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-642-37574-3_7

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. Additional evaluation using synthetic datasets also shows that RP-Tree is more efficient, in addtion to showing how the execution time of RP-Tree changes with transaction length and rare-item itemset size.