Next Article in Journal
Simulation Optimization of Search and Rescue in Disaster Relief Based on Distributed Auction Mechanism
Previous Article in Journal
A Selection Process for Genetic Algorithm Using Clustering Analysis
Article Menu

Export Article

Open AccessArticle
Algorithms 2017, 10(4), 124; https://doi.org/10.3390/a10040124

Improvement of ID3 Algorithm Based on Simplified Information Entropy and Coordination Degree

1
School of Control Science and Engineering, Shandong University, Jinan 250061, China
2
School of Mechanical, Electrical and Information Engineering, Shandong University, Weihai 264209, China
3
Department of Electrical Engineering and Information Technology, Shandong University of Science and Technology, Jinan 250031, China
*
Author to whom correspondence should be addressed.
Received: 2 September 2017 / Revised: 29 October 2017 / Accepted: 2 November 2017 / Published: 6 November 2017
Full-Text   |   PDF [1006 KB, uploaded 6 November 2017]   |  

Abstract

The 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
Keywords: decision tree; ID3 algorithm; information entropy; coordination degree decision tree; ID3 algorithm; information entropy; coordination degree
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

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.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top