Abstract
As a classical data mining algorithm, decision tree has a wide range of application areas. Most of the researches on decision tree are based on ID3 and its derivative algorithms, which are all based on information entropy. In this paper, as the most important key point of the decision tree, the metric of the split attribute is studied. The mutual information is introduced into decision tree classification. The results show that the decision tree classification model based on mutual information is a better classifier. Compared with the ID3 classifier based on information entropy, it is verified that the accuracy of the decision tree algorithm based on mutual information has been greatly improved, and the construction of the classifier is more rapid.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
