An Improved ID3 Algorithm of Decision Trees
Xiangtao Chen
Abstract
Xiangtao Chen
Abstract
According to the gain information in the ID3 algorithm calculation principle,we use the mathematical equivalence of the infinitesimal nature of a newly improved ID3 algorithm to reduce the amount of computation gain information,and improve the information gain computational efficiency in the ID3 algorithm.Compared with the original ID3 algorithm,the Improved ID3 algorithm has the same rate of accuracy and higher speed in the decision tree structure.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
According to the gain information in the ID3 algorithm calculation principle,we use the mathematical equivalence of the infinitesimal nature of a newly improved ID3 algorithm to reduce the amount of computation gain information,and improve the information gain computational efficiency in the ID3 algorithm.Compared with the original ID3 algorithm,the Improved ID3 algorithm has the same rate of accuracy and higher speed in the decision tree structure.
Key concepts: ID3 algorithm, Computer science, ID3, Information gain, Decision tree, Computation, Algorithm, Equivalence (formal languages)