integer node id, from 1
predicted value at the node
current node impurity
whether the node is a leaf
split to calculate left and right nodes
left child
right child
information gain stats
integer node id, from 1
integer node id, from 1
current node impurity
current node impurity
whether the node is a leaf
whether the node is a leaf
left child
left child
predict value if node is not leaf
predict value if node is not leaf
feature value
predicted value
predicted value at the node
predicted value at the node
right child
right child
split to calculate left and right nodes
split to calculate left and right nodes
information gain stats
information gain stats
:: DeveloperApi :: Node in a decision tree.
About node indexing: Nodes are indexed from 1. Node 1 is the root; nodes 2, 3 are the left, right children. Node index 0 is not used.