Abstract
Fuzzy decision tree is generally considered as an extension of crisp decision tree. The algorithms used in fuzzy decision tree induction are often the extended form of those used in crisp decision tree induction. In this paper, the problem is considered from the converse way and a new method is proposed to induce crisp decision tree. One fuzzy decision tree induction algorithm based on classification ambiguity is improved, and then the improved algorithm is applied to induce a crisp decision tree. Experimental results show that a crisp decision tree can be induced by our improved method. The aim of this paper is to provide some useful guidelines for studying the relation between fuzzy decision tree and crisp decision tree.
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.
