Java-friendly constructor for org.apache.spark.mllib.tree.configuration.Strategy
Learning goal. Supported: org.apache.spark.mllib.tree.configuration.Algo.Classification, org.apache.spark.mllib.tree.configuration.Algo.Regression
Criterion used for information gain calculation. Supported for Classification: org.apache.spark.mllib.tree.impurity.Gini, org.apache.spark.mllib.tree.impurity.Entropy. Supported for Regression: org.apache.spark.mllib.tree.impurity.Variance.
Maximum depth of the tree. E.g., depth 0 means 1 leaf node; depth 1 means 1 internal node + 2 leaf nodes.
Number of classes for classification. (Ignored for regression.) Default value is 2 (binary classification).
Maximum number of bins used for discretizing continuous features and for choosing how to split on features at each node. More bins give higher granularity.
Algorithm for calculating quantiles. Supported: org.apache.spark.mllib.tree.configuration.QuantileStrategy.Sort
A map storing information about the categorical variables and the number of discrete values they take. For example, an entry (n -> k) implies the feature n is categorical with k categories 0, 1, 2, ... , k-1. It's important to note that features are zero-indexed.
Maximum memory in MB allocated to histogram aggregation. Default value is 128 MB.
Learning goal.
A map storing information about the categorical variables and the number of discrete values they take.
A map storing information about the categorical variables and the number of discrete values they take. For example, an entry (n -> k) implies the feature n is categorical with k categories 0, 1, 2, ... , k-1. It's important to note that features are zero-indexed.
Criterion used for information gain calculation.
Criterion used for information gain calculation. Supported for Classification: org.apache.spark.mllib.tree.impurity.Gini, org.apache.spark.mllib.tree.impurity.Entropy. Supported for Regression: org.apache.spark.mllib.tree.impurity.Variance.
Maximum number of bins used for discretizing continuous features and for choosing how to split on features at each node.
Maximum number of bins used for discretizing continuous features and for choosing how to split on features at each node. More bins give higher granularity.
Maximum depth of the tree.
Maximum depth of the tree. E.g., depth 0 means 1 leaf node; depth 1 means 1 internal node + 2 leaf nodes.
Maximum memory in MB allocated to histogram aggregation.
Maximum memory in MB allocated to histogram aggregation. Default value is 128 MB.
Number of classes for classification.
Number of classes for classification. (Ignored for regression.) Default value is 2 (binary classification).
Algorithm for calculating quantiles.
Algorithm for calculating quantiles. Supported: org.apache.spark.mllib.tree.configuration.QuantileStrategy.Sort
:: Experimental :: Stores all the configuration options for tree construction