Packages

c

io.citrine.lolo.trees.splits

ClassificationSplitter

case class ClassificationSplitter(randomizedPivotLocation: Boolean = false) extends Splitter[Char] with Product with Serializable

Find the best split for classification problems.

Created by maxhutch on 12/2/16.

Linear Supertypes
Serializable, Serializable, Product, Equals, Splitter[Char], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ClassificationSplitter
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. Splitter
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ClassificationSplitter(randomizedPivotLocation: Boolean = false)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  7. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  8. def getBestCategoricalSplit(data: Seq[(Vector[AnyVal], Char, Double)], calculator: GiniCalculator, index: Int, minCount: Int): (CategoricalSplit, Double)
  9. def getBestRealSplit(data: Seq[(Vector[AnyVal], Char, Double)], calculator: GiniCalculator, index: Int, minCount: Int, randomizePivotLocation: Boolean = false): (RealSplit, Double)

    Find the best split on a continuous variable

    Find the best split on a continuous variable

    If randomizePivotLocation is true, the split pivots are drawn from a uniform random distribution between the two data points. Each such pivot results in the same data split, but randomization can improve generalizability, particularly as part of an ensemble (i.e. random forests).

    data

    to split

    index

    of the feature to split on

    minCount

    minimum number of data points to allow in each of the resulting splits

    randomizePivotLocation

    whether generate splits randomly between the data points (default: false)

    returns

    the best split of this feature

  10. def getBestSplit(data: Seq[(Vector[AnyVal], Char, Double)], numFeatures: Int, minInstances: Int): (Split, Double)

    Get the best split, considering numFeature random features (w/o replacement)

    Get the best split, considering numFeature random features (w/o replacement)

    data

    to split

    numFeatures

    to consider, randomly

    returns

    a split object that optimally divides data

    Definition Classes
    ClassificationSplitterSplitter
  11. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  12. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  13. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  15. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  16. val randomizedPivotLocation: Boolean
  17. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  18. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  20. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from Splitter[Char]

Inherited from AnyRef

Inherited from Any

Ungrouped