Research on Algorithm Based on SLIQ Decision Tree
Huacheng Zhang · Modern Computer · 2009
Proposes an improved SLIQ decision tree classification algorithm,overcomes the shortcomings of the original SLIQ algorithm which needs to calculate numerous GINI indexes of each decision tree node.Introduces the concept of the Density of Data Distribution(D3),and improves the SLIQ algorithm with GINI index based on the ED3.Then adopts the new SLIQ in synthetic evaluation.The result in the example demonstrates that the number of the GINI index is reduced in the improved algorithm while searching the optimal split scheme,and cuts down the cost of sort and the optimal split point,simplifies the size of decision tree.