ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Novel Approach for Frequent Pattern Algorithm for Maximizing Frequent Patterns in Effective Time

Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY (Vol.3, No. 2)

Publication Date:

Authors : ; ;

Page : 279-283

Keywords : FP-Tree; ABWSFP ?Tree; Frequent Patterns; Array Technique;

Source : Download Find it from : Google Scholarexternal

Abstract

The essential aspect of mining association rules is to mine the frequent patterns. Due to native difficulty it is impossible to mine complete frequent patterns from a dense database. FP-growth algorithm has been implemented using an Array-based structure, known as the FP-tree,which is for storing compressed frequency information. Numerous experimental results have demonstrated that the algorithm performs extremely well. But in FP-growth algorithm, two traversals of FP-tree are needed for constructing the new conditional FP-tree. In this paper we present a novel Array Based Without Scanning Frequent Pattern (ABWSFP) tree technique that greatly reduces the need to traverse FP-trees, thus obtaining significantly improved performance for FP-tree based algorithms. The technique works especially well for large datasets. We then present a new algorithm which use the QFP-tree data structure in combination with the FP Tree- Experimental results show that the new algorithm outperform other algorithm in not only the speed of algorithms, but also their CPU consumption and their scalability.

Last modified: 2016-06-30 14:17:27