An encounter with Strong Association Rules

Data mining (DM) is the process of automated extraction of interesting data patterns representing knowledge, from the large data sets. Frequent itemsets are the itemsets that appear in a data set frequently. Finding such frequent itemsets plays an essential role in mining associations, correlations, and many other interesting relationships among itemsets in transactional database. In this paper an algorithm, SAR (strong association rule), is designed and implemented to check whether an association rule (AR) is strong enough or not. A priori algorithm is also implemented to generate frequent k-itemsets. A Binary transactional dataset is used for implementing the algorithm in Java language.