Improvement of ID3 Algorithm Based on Simplified Information Entropy and Coordination Degree
AbstractThe decision tree algorithm is a core technology in data classification mining, and ID3 (Iterative Dichotomiser 3) algorithm is a famous one, which has achieved good results in the field of classification mining. Nevertheless, there exist some disadvantages of ID3 such as attributes biasing multi-values, high complexity, large scales, etc. In this paper, an improved ID3 algorithm is proposed that combines the simplified information entropy based on different weights with coordination degree in rough set theory. The traditional ID3 algorithm and the proposed one are fairly compared by using three common data samples as well as the decision tree classifiers. It is shown that the proposed algorithm has a better performance in the running time and tree structure, but not in accuracy than the ID3 algorithm, for the first two sample sets, which are small. For the third sample set that is large, the proposed algorithm improves the ID3 algorithm for all of the running time, tree structure and accuracy. The experimental results show that the proposed algorithm is effective and viable. View Full-Text
Share & Cite This Article
Wang, Y.; Li, Y.; Song, Y.; Rong, X.; Zhang, S. Improvement of ID3 Algorithm Based on Simplified Information Entropy and Coordination Degree. Algorithms 2017, 10, 124.
Wang Y, Li Y, Song Y, Rong X, Zhang S. Improvement of ID3 Algorithm Based on Simplified Information Entropy and Coordination Degree. Algorithms. 2017; 10(4):124.Chicago/Turabian Style
Wang, Yingying; Li, Yibin; Song, Yong; Rong, Xuewen; Zhang, Shuaishuai. 2017. "Improvement of ID3 Algorithm Based on Simplified Information Entropy and Coordination Degree." Algorithms 10, no. 4: 124.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.