Frequent item set mining and association rule mining is the key tasks in knowledge discovery process. Various customized algorithms are being implemented in Association Rule Mining process to find the set of frequent patterns. Though we have many algorithms apriori is one of the standard algorithm for finding frequent itemsets, but this algorithm is inefficient because of several scans of database and more number of candidates to be generated. To overcome these limitations, in this paper a new algorithm called Coalesce based Binary Table is introduced. Through this algorithm the given database is scanned only once to generate Binary Table by which frequent-1 itemsets are found. To progress the process, infrequent-1 itemsets are identified and removed from the Binary Table to rearrange the items in support ascending order. To each frequent-1 itemset find Coalesce matrix and Index List to generate all frequent itemsets having the same support count as representative items and the remaining frequent itemsets are obtained in depth first manner. The significant benefits with the proposed method are the whole database is scanned only once, no need to generate and check each candidate to find the set of frequent items. On the other hand frequent items having the same support counts as representative items can be identified directly by joining the representative item with all the combinations of Coalesce matrix. So, it is proven that coalesce based Binary Table is panacea to cut short the time in identifying the frequent itemsets hence the efficiency is improved.
Coalesce based binary table: an enhanced algorithm for mining frequent patterns
