TRARM-RelSup: Targeted Rare Association Rule Mining Using Itemset Trees and the Relative Support Measure

Author(s):  
Jennifer Lavergne ◽  
Ryan Benton ◽  
Vijay V. Raghavan
2012 ◽  
Vol 53 (3) ◽  
pp. 1-6 ◽  
Author(s):  
N. Hoque ◽  
B. Nath ◽  
D. K. Bhattacharyya

Author(s):  
Keerti Shrivastava ◽  
Varsha Jotwani

Data mining is a method for finding patterns from repositories that remain hidden, unknown but fascinating. It has resulted in a number of strategies and emphasizes the detection of patterns to identify patterns that occur frequently, seldom and rarely. With their implementations, the work has improved the efficiency of the techniques. Yet typical methods for data mining are limited to databases with static behavior. The first move was to investigate similarities between the common objects through association rules mining. The original motivation for the search for these guidelines was the consumers ' shopping patterns in transaction data for supermarkets. This attempts to classify combinations of items or items that influence the presence likelihood of other items or items in a transaction. The request for rare association rule mining has improved in current years. The identification of unusual data patterns is critical, including medical, financial, or security applications. This survey seeks to give an analysis of rare pattern mining strategies, which in general, comprehensive and constructed. We discuss the issues in the quest for unusual rules using conventional association principles. Because mining rules for rare associations are not well known, special foundations still need to be set up.


Author(s):  
Yun Sing Koh ◽  
Russel Pears

Rare association rule mining has received a great deal of attention in the past few years. In this chapter, the authors propose a multi methodological approach to the problem of rare association rule mining that integrates three different strands of research in this area. Firstly, the authors make use of statistical techniques such as the Fisher test to determine whether itemsets co-occur by chance or not. Secondly, they use clustering as a pre-processing technique to improve the quality of the rare rules generated. Their third strategy is to weigh itemsets to ensure upward closure, thus checking unbounded growth of the rule base. Their results show that clustering isolates heterogeneous segments from each other, thus promoting the discovery of rules which would otherwise remain undiscovered. Likewise, the use of itemset weighting tends to improve rule quality by promoting the generation of rules with rarer itemsets that would otherwise not be possible with a simple weighting scheme that assigns an equal weight to all possible itemsets. The use of clustering enabled us to study in detail an important sub-class of rare rules, which we term absolute rare rules. Absolute rare rules are those are not just rare to the dataset as a whole but are also rare to the cluster from which they are derived.


Sign in / Sign up

Export Citation Format

Share Document