Timeline for What is the max number of leaf nodes in a classifcation decision tree?
Current License: CC BY-SA 4.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 8 at 4:03 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Jun 6 at 16:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 3 at 2:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Oct 1, 2023 at 8:06 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| May 28, 2023 at 1:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Apr 27, 2023 at 17:09 | answer | added | Sachin | timeline score: 0 | |
| Apr 27, 2023 at 17:04 | answer | added | Alan Apter | timeline score: 0 | |
| Apr 30, 2022 at 10:27 | comment | added | Erwan | number of internal nodes, yes. not sure what you mean with "the result is minus 1" ? | |
| Apr 30, 2022 at 5:07 | comment | added | giacomo venturelli | the max number of nodes is 2 to the power of max depth-1 and the result is minus 1 | |
| Apr 29, 2022 at 21:39 | comment | added | Erwan | Yes, that's correct. Also you know the max depth because it depends on the number of features. | |
| Apr 29, 2022 at 19:31 | comment | added | giacomo venturelli | if I consider the root as dept zero the max leaves that it can have will be will be 2 to the power of the depth. So a tree with depth 2 will have max 4 leaves. | |
| Apr 28, 2022 at 21:53 | comment | added | Erwan | The question doesn't depend on which algorithm, it depends only on general properties of decision trees. Remember that every internal node is made of a condition on a particular feature, and since the features are binary there are exactly two branches under each internal node. Using this you can obtain the max depth of a tree and then the answers. | |
| Apr 28, 2022 at 20:12 | comment | added | giacomo venturelli | it is a mock exam question. To be honest I don't know how many leaves a decision tree should have, there is no right answer as the tree is generated using different algorithm and different parameters so all trees will be different. This is my understanding. | |
| Apr 28, 2022 at 15:11 | comment | added | Erwan | Welcome to DataScienceSE. Is this homework? If so please show your work and/or explain your difficulty. | |
| S Apr 28, 2022 at 13:19 | review | First questions | |||
| Apr 28, 2022 at 14:23 | |||||
| S Apr 28, 2022 at 13:19 | history | asked | giacomo venturelli | CC BY-SA 4.0 |