Analysis of FP-Growth Tree Based Algorithms: CP-Tree and K Map

Analysis of FP-Growth Tree Based Algorithms: CP-Tree and K Map

Pragya Raghuwanshi#, Hemang Shrivastava*, Neeraj Chandnani**

#M.Tech. Scholar, Institute of Advance Computing (Specialization), SAGE University, Indore,

Email: pragyaraguwanshi7415@gmail.com

*Head of Department, Institute of Advance Computing (Specialization), SAGE University, Indore,

Email: drhemang.shrivastava@sageuniversity.in

**Institute of Advance Computing (Specialization), SAGE University, Indore, Email: chandnani.neeraj@gmail.com

Corresponding Author: Neeraj Chandnani (Email: chandnani.neeraj@gmail.com)

Abstract :  This study We recommend a novel frequent-pattern tree (FP-tree) structure. Our performance study illustrates that the FP-growth method is approximately an order of magnitude faster than the Apriority algorithm and some recently reported new frequent-pattern mining methods. It is also efficient and scalable for mining both long and short frequent patterns. Whether frequent data patterns are short or long, the FP-tree approach is an effective association mining algorithm for mining them. It is possible to significantly lower search costs by employing partitioning-based, divide-and-conquer, and compact optimal tree structure data mining searching techniques. It works similarly to the examination of many CPUs or computer memory reduction. However, it appears that this method can reduce the costs associated with integrating and sharing control information, and it also significantly reduces algorithm complexity, which effectively solves the issue. The greatest performance boost is still going to be restricted, even with the primary adoption of the multi-CPU strategy, raising the demand essentially is hardware. Is there any other option for the majority to lower these building costs for FP-trees, while the best performance improvement is still restricted?

Keyword; Partitioning-based, Parallel, Projection, DM, AI, Information, FP-tree, data Mining, CP-Tree, K-Map, Clustering.