z-logo
open-access-imgOpen Access
Improved algorithm of decision tree based on neural network
Author(s) -
Min Zhang,
Peng Hong-wei,
Xiao Yan
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1693/1/012081
Subject(s) - incremental decision tree , overfitting , decision tree , id3 algorithm , decision stump , computer science , artificial neural network , artificial intelligence , decision tree learning , alternating decision tree , machine learning , data mining , classifier (uml) , algorithm
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here