Skip to main content
Cross Validated

Return to Question

Bumped by Community user
Post Reopened by Scortchi♦
added 14 characters in body
Source Link
user6845158
user6845158
  • 43
  • 1
  • 1
  • 7

The trees in a Random Forest are grown by recursive splitting the nodes, and the best split in each node is obtained by using the Gini index, I want to know if there is a possibility to know the number of all possible split-cuts? For example by knowing the dimension of data and mtry ?

The trees in a Random Forest are grown by recursive splitting the nodes, and the best split in each node is obtained by using the Gini index, I want to know if there is a possibility to know all possible split-cuts? For example by knowing the dimension of data and mtry ?

The trees in a Random Forest are grown by recursive splitting the nodes, and the best split in each node is obtained by using the Gini index, I want to know if there is a possibility to know the number of all possible split-cuts? For example by knowing the dimension of data and mtry ?

Post Closed as "Duplicate" by whuber♦
added 14 characters in body
Source Link
user6845158
user6845158
  • 43
  • 1
  • 1
  • 7

The trees in a Random Forest are grown by recursive splitting the nodes, and the best split in each node is obtained by using the Gini index, I want to know if there is a possibility to know all possible split-cuts? For example by knowing the dimension of data and mtry  ?

The trees in a Random Forest are grown by recursive splitting the nodes, and the best split in each node is obtained by using the Gini index, I want to know if there is a possibility to know all possible split-cuts by knowing the dimension of data and mtry?

The trees in a Random Forest are grown by recursive splitting the nodes, and the best split in each node is obtained by using the Gini index, I want to know if there is a possibility to know all possible split-cuts? For example by knowing the dimension of data and mtry  ?

Source Link
user6845158
user6845158
  • 43
  • 1
  • 1
  • 7

Number of all possible splits in each node of trees in a Random Forest

The trees in a Random Forest are grown by recursive splitting the nodes, and the best split in each node is obtained by using the Gini index, I want to know if there is a possibility to know all possible split-cuts by knowing the dimension of data and mtry?