org.apache.spark.mllib.tree

DecisionTree

object DecisionTree extends Serializable with Logging

Annotations
@Since( "1.0.0" )
Linear Supertypes
Logging, Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DecisionTree
  2. Logging
  3. Serializable
  4. Serializable
  5. AnyRef
  6. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  8. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  9. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  10. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  11. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  12. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  13. def initializeLogIfNecessary(isInterpreter: Boolean): Unit

    Attributes
    protected
    Definition Classes
    Logging

  14. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  15. def isTraceEnabled(): Boolean

    Attributes
    protected
    Definition Classes
    Logging

  16. def log: Logger

    Attributes
    protected
    Definition Classes
    Logging

  17. def logDebug(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging

  18. def logDebug(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging

  19. def logError(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging

  20. def logError(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging

  21. def logInfo(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging

  22. def logInfo(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging

  23. def logName: String

    Attributes
    protected
    Definition Classes
    Logging

  24. def logTrace(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging

  25. def logTrace(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging

  26. def logWarning(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging

  27. def logWarning(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging

  28. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  29. final def notify(): Unit

    Definition Classes
    AnyRef

  30. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  31. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  32. def toString(): String

    Definition Classes
    AnyRef → Any

  33. def train(input: RDD[LabeledPoint], algo: Algo, impurity: Impurity, maxDepth: Int, numClasses: Int, maxBins: Int, quantileCalculationStrategy: QuantileStrategy, categoricalFeaturesInfo: Map[Int, Int]): DecisionTreeModel

    Method to train a decision tree model.

    Method to train a decision tree model. The method supports binary and multiclass classification and regression.

    input

    Training dataset: RDD of org.apache.spark.mllib.regression.LabeledPoint. For classification, labels should take values {0, 1, ..., numClasses-1}. For regression, labels are real numbers.

    algo

    Type of decision tree, either classification or regression.

    impurity

    Criterion used for information gain calculation.

    maxDepth

    Maximum depth of the tree (e.g. depth 0 means 1 leaf node, depth 1 means 1 internal node + 2 leaf nodes).

    numClasses

    Number of classes for classification. Default value of 2.

    maxBins

    Maximum number of bins used for splitting features.

    quantileCalculationStrategy

    Algorithm for calculating quantiles.

    categoricalFeaturesInfo

    Map storing arity of categorical features. An entry (n to k) indicates that feature n is categorical with k categories indexed from 0: {0, 1, ..., k-1}.

    returns

    DecisionTreeModel that can be used for prediction.

    Annotations
    @Since( "1.0.0" )
    Note

    Using org.apache.spark.mllib.tree.DecisionTree$#trainClassifier and org.apache.spark.mllib.tree.DecisionTree$#trainRegressor is recommended to clearly separate classification and regression.

  34. def train(input: RDD[LabeledPoint], algo: Algo, impurity: Impurity, maxDepth: Int, numClasses: Int): DecisionTreeModel

    Method to train a decision tree model.

    Method to train a decision tree model. The method supports binary and multiclass classification and regression.

    input

    Training dataset: RDD of org.apache.spark.mllib.regression.LabeledPoint. For classification, labels should take values {0, 1, ..., numClasses-1}. For regression, labels are real numbers.

    algo

    Type of decision tree, either classification or regression.

    impurity

    Criterion used for information gain calculation.

    maxDepth

    Maximum depth of the tree (e.g. depth 0 means 1 leaf node, depth 1 means 1 internal node + 2 leaf nodes).

    numClasses

    Number of classes for classification. Default value of 2.

    returns

    DecisionTreeModel that can be used for prediction.

    Annotations
    @Since( "1.2.0" )
    Note

    Using org.apache.spark.mllib.tree.DecisionTree$#trainClassifier and org.apache.spark.mllib.tree.DecisionTree$#trainRegressor is recommended to clearly separate classification and regression.

  35. def train(input: RDD[LabeledPoint], algo: Algo, impurity: Impurity, maxDepth: Int): DecisionTreeModel

    Method to train a decision tree model.

    Method to train a decision tree model. The method supports binary and multiclass classification and regression.

    input

    Training dataset: RDD of org.apache.spark.mllib.regression.LabeledPoint. For classification, labels should take values {0, 1, ..., numClasses-1}. For regression, labels are real numbers.

    algo

    Type of decision tree, either classification or regression.

    impurity

    Criterion used for information gain calculation.

    maxDepth

    Maximum depth of the tree (e.g. depth 0 means 1 leaf node, depth 1 means 1 internal node + 2 leaf nodes).

    returns

    DecisionTreeModel that can be used for prediction.

    Annotations
    @Since( "1.0.0" )
    Note

    Using org.apache.spark.mllib.tree.DecisionTree$#trainClassifier and org.apache.spark.mllib.tree.DecisionTree$#trainRegressor is recommended to clearly separate classification and regression.

  36. def train(input: RDD[LabeledPoint], strategy: Strategy): DecisionTreeModel

    Method to train a decision tree model.

    Method to train a decision tree model. The method supports binary and multiclass classification and regression.

    input

    Training dataset: RDD of org.apache.spark.mllib.regression.LabeledPoint. For classification, labels should take values {0, 1, ..., numClasses-1}. For regression, labels are real numbers.

    strategy

    The configuration parameters for the tree algorithm which specify the type of decision tree (classification or regression), feature type (continuous, categorical), depth of the tree, quantile calculation strategy, etc.

    returns

    DecisionTreeModel that can be used for prediction.

    Annotations
    @Since( "1.0.0" )
    Note

    Using org.apache.spark.mllib.tree.DecisionTree$#trainClassifier and org.apache.spark.mllib.tree.DecisionTree$#trainRegressor is recommended to clearly separate classification and regression.

  37. def trainClassifier(input: JavaRDD[LabeledPoint], numClasses: Int, categoricalFeaturesInfo: Map[Integer, Integer], impurity: String, maxDepth: Int, maxBins: Int): DecisionTreeModel

    Java-friendly API for org.apache.spark.mllib.tree.DecisionTree$#trainClassifier

    Java-friendly API for org.apache.spark.mllib.tree.DecisionTree$#trainClassifier

    Annotations
    @Since( "1.1.0" )

  38. def trainClassifier(input: RDD[LabeledPoint], numClasses: Int, categoricalFeaturesInfo: Map[Int, Int], impurity: String, maxDepth: Int, maxBins: Int): DecisionTreeModel

    Method to train a decision tree model for binary or multiclass classification.

    Method to train a decision tree model for binary or multiclass classification.

    input

    Training dataset: RDD of org.apache.spark.mllib.regression.LabeledPoint. Labels should take values {0, 1, ..., numClasses-1}.

    numClasses

    Number of classes for classification.

    categoricalFeaturesInfo

    Map storing arity of categorical features. An entry (n to k) indicates that feature n is categorical with k categories indexed from 0: {0, 1, ..., k-1}.

    impurity

    Criterion used for information gain calculation. Supported values: "gini" (recommended) or "entropy".

    maxDepth

    Maximum depth of the tree (e.g. depth 0 means 1 leaf node, depth 1 means 1 internal node + 2 leaf nodes). (suggested value: 5)

    maxBins

    Maximum number of bins used for splitting features. (suggested value: 32)

    returns

    DecisionTreeModel that can be used for prediction.

    Annotations
    @Since( "1.1.0" )

  39. def trainRegressor(input: JavaRDD[LabeledPoint], categoricalFeaturesInfo: Map[Integer, Integer], impurity: String, maxDepth: Int, maxBins: Int): DecisionTreeModel

    Java-friendly API for org.apache.spark.mllib.tree.DecisionTree$#trainRegressor

    Java-friendly API for org.apache.spark.mllib.tree.DecisionTree$#trainRegressor

    Annotations
    @Since( "1.1.0" )

  40. def trainRegressor(input: RDD[LabeledPoint], categoricalFeaturesInfo: Map[Int, Int], impurity: String, maxDepth: Int, maxBins: Int): DecisionTreeModel

    Method to train a decision tree model for regression.

    Method to train a decision tree model for regression.

    input

    Training dataset: RDD of org.apache.spark.mllib.regression.LabeledPoint. Labels are real numbers.

    categoricalFeaturesInfo

    Map storing arity of categorical features. An entry (n to k) indicates that feature n is categorical with k categories indexed from 0: {0, 1, ..., k-1}.

    impurity

    Criterion used for information gain calculation. The only supported value for regression is "variance".

    maxDepth

    Maximum depth of the tree (e.g. depth 0 means 1 leaf node, depth 1 means 1 internal node + 2 leaf nodes). (suggested value: 5)

    maxBins

    Maximum number of bins used for splitting features. (suggested value: 32)

    returns

    DecisionTreeModel that can be used for prediction.

    Annotations
    @Since( "1.1.0" )

  41. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  42. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  43. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Logging

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped