Customer Relationship Management Based on SPRINT Classification Algorithm under Data Mining Technology

Algorithm 2

FPtree based on database.

(i)	Input:
(ii)	A minimum support alpha, a transaction database DB
(iii)	Output: FPtree
(iv)	Procedure FPtree (DB, alpha)
(v)	{
(vi)	Create FPtree T and mark it as “NULL”.
(vii)	For the DB
(viii)	{
(ix)	For each I I ∈ Ti
(x)	{
(xi)	If I ∈ (S)
(xii)	Then joins the set S ′
(xiii)	The else delete
(xiv)	}
(xv)	Rank the frequencies in S ′according to the order in S - item for the [p |p].
(xvi)	Insert_tree ([p |p], T)
(xvii)	}
(xviii)	}
(xix)	Procedure Insert_tree ([p |p], T)
(xx)	{
	child N of For T
	{
	If N.itemname = P.itemname
	Then N.count++; flag = true; Break;
	}
	If(! Flag)
	Then
	{
	Create a new child of T N N ount = 1
	Make n.node_link point to a node with the same item_name field.
	}
	If P is not empty
	Then Insert_tree (P, N)
	}