Influence Model of Analyzing the Effect of Mental Health Level Based on Big Data Mining System

Table 1

Common decision tree algorithms.

Decision tree algorithm	Algorithm description
ID3 algorithm	The core of ID3 algorithm is to use the information gain method as the selection criteria of attributes at each level of the decision tree to help determine the appropriate attributes to be used when generating each node.
C4. 5 algorithm	The selection of node attributes is determined by information gain rate, which is a derivation and improvement of ID3 algorithm. ID3 decision tree algorithm is usually suitable for discrete description attributes, while C45 decision tree algorithm can deal with continuous attributes and discrete description attributes.
Cart algorithm	It is a very useful nonparametric classification and regression method. Usually, the construction and generation of binary tree have three processes: Construction tree, pruning tree, and evaluation tree. When the end point is a classification variable, the tree is a classification tree. When the end point is a persistent variable, the tree is a regression tree.