Skip to Main Content
The decision tree based on the k-means algorithm has recently been proposed. However, the drawback of the k-means algorithm is that the users must determine the number of branches for each node before the decision tree is designed. The users are usually hard to determine the number of branches for each node. In this study, the new decision tree with variable-branches is proposed. The genetic algorithm is proposed to determine the number of branches for each node in the new decision tree. Thus, the proposed new decision tree approaches to near-optimization.
Computer Communication Control and Automation (3CA), 2010 International Symposium on (Volume:1 )
Date of Conference: 5-7 May 2010