TCM Constitution Analysis Method Based on Parallel FP-Growth Algorithm in Hadoop Framework

Algorithm 2

Mining local frequent item sets with FP-growth.

	Input: (line offset, T)
	Output: (Ti, L)
	map:L = GetSortedItemList()
	t = Sort(Ti, L)
	Qi = seachGroup(t.get(t.length-1))
	output(Qi, 1)
	reduce:etLocalSupport()
	initCFPTree (Tree)
	while values.hasNext()
	CFPTree insert (Tree, values.next().get())
	FP = LocalFPGrowth (Ii,Tree)
	output (LocalFP count, null)
	dispose:Sum (count)
	if (FPcount > minSup)
	output (FP, count)