We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 9a90c93 commit 12e6d0aCopy full SHA for 12e6d0a
docs/mllib-decision-tree.md
@@ -86,7 +86,7 @@ details). For example, for a binary classification problem with one categorical
86
categories A, B and C with corresponding proportion of label 1 as 0.2, 0.6 and 0.4, the categorical
87
features are ordered as A followed by C followed B or A, B, C. The two split candidates are A \| C, B
88
and A , B \| C where \| denotes the split.
89
-<!-- -->
+
90
### Stopping rule
91
92
The recursive tree construction is stopped at a node when one of the two conditions is met:
0 commit comments