biologyandotherfields.FP-growthalgorithmisoneoftheclassicalgorithmsfor miningassociationruleswithoutcandidategeneration,comparedwithApriorialgorithm FP-growthimprovestheoperationefficiency,soithasbeenwidelyusedinlotsoffields. FP-growthalgorithmhassomeadvantages,forexamplesitproducestoomany FP-treesandtakesuptoomuchmemory...
Keywords: Data mining,Quantitative attributes, Frequent patterns, FP-growth algorithm,consider D as a set of transactions, where eachI. INTRODUCTIONtransaction, denoted by T, is a subset of items I.Data mining has recently attracted considerable attention from database practitioners and researchers ...
In this paper, we propose an efficient algorithm, called TD-FPGrowth (the shorthand for Top-Down FP-Growth), to mine frequent patterns. TD-FP-Growth searches the FP-tree in the top-down order, as opposed to the bottom-up order of previously proposed FP-Growth. The advantage of the top...
Fig. 2. Example of the header table and the corresponding FP-Tree To explore information stored in an FP-tree and extract the complete set of frequent patterns, the algorithm FP-Growth, has been applied [Han, 2004]. The FP- Growth starts to mine the frequent patterns 1-itemset and ...