Abstract
Decision trees have been applied to solve many data mining problems due to their superior learning and classification capabilities, and have achieved good results. However, for dealing with big data and complex model problems, decision trees show insufficient accuracy and overfitting. In order to solve these problems, neural network is introduced as a decision tree node, and an improved algorithm based on neural network decision tree is proposed. In the neural network decision tree, the classifier learning consists of two stages: the first stage uses a heuristic algorithm with reduced uncertainty to divide the big data, and stops the growth of the decision tree until the node dividing ability is below a certain threshold; in the second stage, the neural network is used to classify the decision-making leaf node with generalization ability. The experimental results show that compared with the traditional classification learning algorithm, the algorithm has a higher accuracy rate and it can determine the size of decision tree through structural adaptation for the classification problem of identifying big data and complex patterns.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.