This paper introduces the classification model of random decision tree and how to heuristic selected the depth and the number, the experiment shows that the algorithm is effectiveness and efficiency.
Minimum entropy is chosen as a heuristic strategy in decision tree (DT) learning algorithm such as ID3.
决策树的学习算法，比如id3算法，选用最小信息熵作为启发式信息。
3
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.