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

Algorithm 4

Optimal customer retention strategy algorithm.

	Input: decision tree d_tree with attrition rate. The revenue that customers bring to the company is P E
	The cost set S consumed by the movement between leaf nodes
	Output: customer best leaf node
	Procedure BestSelect (D-tree, C, P E)
	{
	Int I = 1, k;
	Double d;//Determine whether the customer belongs to the category k
	D = leaf_node[k].
	while(i< = n)
	{
	If d< = leaf_node [I]
	Then continue.
	Else P[I] = P E(d-leaf_node [k].d)//Cost of moving between leaves
	}
	The maximum value of P[I] is found, and the optimal leaf node is J
	}