Abstract
Decision tree classification is one of the most widely-used methods in data mining which can provide useful decision-making analysis for users. But most of the decision tree methods have some efficiency bottle-necks and can only applied to small-scale datasets. In this paper, we present an new improved synthesized decision tree algorithm named CA which includes three important parts like dimension reduction, pre-clustering and decision tree method, and also give out its formalized specification. Through dimension reduction and synthesized pre-clustering methods, we can optimize the initial dataset and considerably reduce the decision tree’s input computation costs. We also improve the decision tree method by introducing parallel processing concept which can enhance its calculation precision and decision efficiency. This paper applies CA into maize seed breeding and analyzes its efficiency in every part comparing with original methods, and the results shows that CA algorithm is better.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
More From: Advanced Materials Research
Disclaimer: 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.