Class/Object

org.apache.spark.mllib.tree.configuration

BoostingStrategy

Related Docs: object BoostingStrategy | package configuration

Permalink

case class BoostingStrategy(treeStrategy: Strategy, loss: Loss, numIterations: Int = 100, learningRate: Double = 0.1, validationTol: Double = 0.001) extends Serializable with Product

Configuration options for org.apache.spark.mllib.tree.GradientBoostedTrees.

treeStrategy

Parameters for the tree algorithm. We support regression and binary classification for boosting. Impurity setting will be ignored.

loss

Loss function used for minimization during gradient boosting.

numIterations

Number of iterations of boosting. In other words, the number of weak hypotheses used in the final model.

learningRate

Learning rate for shrinking the contribution of each estimator. The learning rate should be between in the interval (0, 1]

validationTol

validationTol is a condition which decides iteration termination when runWithValidation is used. The end of iteration is decided based on below logic: If the current loss on the validation set is greater than 0.01, the diff of validation error is compared to relative tolerance which is validationTol * (current loss on the validation set). If the current loss on the validation set is less than or equal to 0.01, the diff of validation error is compared to absolute tolerance which is validationTol * 0.01. Ignored when org.apache.spark.mllib.tree.GradientBoostedTrees.run() is used.

Annotations
@Since( "1.2.0" )
Source
BoostingStrategy.scala
Linear Supertypes
Product, Equals, Serializable, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BoostingStrategy
  2. Product
  3. Equals
  4. Serializable
  5. Serializable
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BoostingStrategy(treeStrategy: Strategy, loss: Loss, numIterations: Int = 100, learningRate: Double = 0.1, validationTol: Double = 0.001)

    Permalink

    treeStrategy

    Parameters for the tree algorithm. We support regression and binary classification for boosting. Impurity setting will be ignored.

    loss

    Loss function used for minimization during gradient boosting.

    numIterations

    Number of iterations of boosting. In other words, the number of weak hypotheses used in the final model.

    learningRate

    Learning rate for shrinking the contribution of each estimator. The learning rate should be between in the interval (0, 1]

    validationTol

    validationTol is a condition which decides iteration termination when runWithValidation is used. The end of iteration is decided based on below logic: If the current loss on the validation set is greater than 0.01, the diff of validation error is compared to relative tolerance which is validationTol * (current loss on the validation set). If the current loss on the validation set is less than or equal to 0.01, the diff of validation error is compared to absolute tolerance which is validationTol * 0.01. Ignored when org.apache.spark.mllib.tree.GradientBoostedTrees.run() is used.

    Annotations
    @Since( "1.4.0" )

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  8. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  9. def getLearningRate(): Double

    Permalink
    Annotations
    @Since( "1.2.0" )
  10. def getLoss(): Loss

    Permalink
    Annotations
    @Since( "1.2.0" )
  11. def getNumIterations(): Int

    Permalink
    Annotations
    @Since( "1.2.0" )
  12. def getTreeStrategy(): Strategy

    Permalink
    Annotations
    @Since( "1.2.0" )
  13. def getValidationTol(): Double

    Permalink
    Annotations
    @Since( "1.4.0" )
  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. var learningRate: Double

    Permalink

    Learning rate for shrinking the contribution of each estimator.

    Learning rate for shrinking the contribution of each estimator. The learning rate should be between in the interval (0, 1]

    Annotations
    @Since( "1.2.0" )
  16. var loss: Loss

    Permalink

    Loss function used for minimization during gradient boosting.

    Loss function used for minimization during gradient boosting.

    Annotations
    @Since( "1.2.0" )
  17. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  20. var numIterations: Int

    Permalink

    Number of iterations of boosting.

    Number of iterations of boosting. In other words, the number of weak hypotheses used in the final model.

    Annotations
    @Since( "1.2.0" )
  21. def setLearningRate(arg0: Double): Unit

    Permalink
    Annotations
    @Since( "1.2.0" )
  22. def setLoss(arg0: Loss): Unit

    Permalink
    Annotations
    @Since( "1.2.0" )
  23. def setNumIterations(arg0: Int): Unit

    Permalink
    Annotations
    @Since( "1.2.0" )
  24. def setTreeStrategy(arg0: Strategy): Unit

    Permalink
    Annotations
    @Since( "1.2.0" )
  25. def setValidationTol(arg0: Double): Unit

    Permalink
    Annotations
    @Since( "1.4.0" )
  26. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  27. var treeStrategy: Strategy

    Permalink

    Parameters for the tree algorithm.

    Parameters for the tree algorithm. We support regression and binary classification for boosting. Impurity setting will be ignored.

    Annotations
    @Since( "1.2.0" )
  28. var validationTol: Double

    Permalink

    validationTol is a condition which decides iteration termination when runWithValidation is used.

    validationTol is a condition which decides iteration termination when runWithValidation is used. The end of iteration is decided based on below logic: If the current loss on the validation set is greater than 0.01, the diff of validation error is compared to relative tolerance which is validationTol * (current loss on the validation set). If the current loss on the validation set is less than or equal to 0.01, the diff of validation error is compared to absolute tolerance which is validationTol * 0.01. Ignored when org.apache.spark.mllib.tree.GradientBoostedTrees.run() is used.

    Annotations
    @Since( "1.4.0" )
  29. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Product

Inherited from Equals

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped