Improvement of ID3 algorithm based on simplified information entropy and coordination degree
Authors:
- 1 October 2017
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1526-1530
Abstract
In data classification mining, the decision tree method is a key algorithm. ID3 (Iterative Dichotomiser 3) algorithm which was presented by Quinlan is a famous decision tree algorithms, but ID3 has some shortcomings such as high complex computation in computing the information entropy expression, multivalue bios problem in the process of selecting an optimal attribute, large scales, etc. In order to solve the above problems, the improved ID3 algorithm is proposed, which combines the simplified information entropy with coordination degree in rough set theory. The experiment result has proved the feasibility of the optimized way.Keywords
This publication has 7 references indexed in Scilit:
- Coordination Degree of Urban Population, Economy, Space, and Environment in Shenyang Since 1990China Population, Resources and Environment, 2008
- MMR: An algorithm for clustering categorical data using Rough Set TheoryData & Knowledge Engineering, 2007
- THE INFORMATION ENTROPY, ROUGH ENTROPY AND KNOWLEDGE GRANULATION IN ROUGH SET THEORYInternational Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2004
- On a Riemann–Liouville Generalized Taylor's FormulaJournal of Mathematical Analysis and Applications, 1999
- Statistical Classification Methods in Consumer Credit Scoring: A ReviewJournal of the Royal Statistical Society Series A: Statistics in Society, 1997
- ARTMAP: Supervised real-time learning and classification of nonstationary data by a self-organizing neural networkNeural Networks, 1991
- Evaluation and Treatment of Adolescent Substance Abuse: A Decision Tree MethodThe American Journal of Drug and Alcohol Abuse, 1990