ID3 algorithm for decision tree analysis and optimization
Fan Tai-hua
Abstract
Fan Tai-hua
Abstract
First,ID3 algorithm's basic principles and major shortcomings,and advantages and disadvantages of several existing improved algorithms are simply analyzed by this paper.Then for ID3 algorithm the main drawback that tends to select the attribute which has more values,which has been significantly improved by using the rough set theory and mathematical know-ledge points.Theoretical analysis and experimental results show that the improved algorithm,to a certain extent,not only can well solve the multi-valued bias problem of ID3 algorithm and greatly simplify the computational process,obviously improve the algorithm's classification accuracy and implementation efficiency.
OpenAlex reports 1 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.
First,ID3 algorithm's basic principles and major shortcomings,and advantages and disadvantages of several existing improved algorithms are simply analyzed by this paper.Then for ID3 algorithm the main drawback that tends to select the attribute which has more values,which has been significantly improved by using the rough set theory and mathematical know-ledge points.Theoretical analysis and experimental results show that the improved algorithm,to a certain extent,not only can well solve the multi-valued bias problem of ID3 algorithm and greatly simplify the computational process,obviously improve the algorithm's classification accuracy and implementation efficiency.
Key concepts: Computer science, ID3 algorithm, ID3, Decision tree, Algorithm, Rough set, Process (computing), Set (abstract data type)