Abstract
Decision tree algorithm is a very active research area of data mining. This paper describes the basic decision tree idea in data mining, then discusses the computational complexity of the classical decision tree algorithm (ID3 algorithm). And the improved algorithm to construct a decision tree by using statistical theory and ideas of conditional probability is proposed in this paper. Experiments show that the computational complexity of this decision tree algorithm is superior to the traditional algorithm, and its efficiency is greatly improved.
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.
