A novel approach to generate frequent pattern using combination and filtering method

Frequent patterns play vital role in generating association rules. The frequent patterns are generated from a huge transaction database as a first step and strong association rules are generated as the next step. The input database contains transactions which consist of transaction identifier and a set of items. A number of algorithms have been proposed to determine frequent patterns. Apriori algorithm is the first and foremost algorithm proposed in this field. It mines the frequent patterns by scanning the database as {Tid, itemset}. Vertical data format technique uses {item, TidSet} way of scanning the database to mine frequent patterns efficiently. In the second approach, the transaction database is transformed into vertical format for mining frequent patterns and intersection method is used to find support count. In both the above algorithms, a huge number of candidate sets are generated which are then pruned using Apriori property. This pruning process generates a huge collection of subsets for each candidate set. These subsets are pruned for existence in prior level frequent sets. This makes an overhead in terms of memory and time. In this paper, a different technique namely Direct-vertical, is proposed that improves the performance in terms of memory and time consumption. This algorithm is based on both Apriori and vertical data format and is proved better than other algorithms in terms of number of subsets and candidate sets.