A New Approach for Extracting Closed Frequent Patterns and their Association Rules using Compressed Data Structure

摘要: mining, term frequent pattern extraction is largely used for finding out association rules. Generally rule mining approaches are as bottom-up or top-down approach on compressed data structure. In the past, different works proposed to mine patterns from giving databases. this paper, we propose a new by applying closed & intersection using We have and approach. This combined allows diminishing search time reducing database scan their The complexity of algorithm less while classical like priori has taken more given items in dataset. Experimental results show that our efficient effective than traditional apriori algorithm.