Class

com.stripe.brushfire

BinnedBinaryError

Related Doc: package brushfire

Permalink

case class BinnedBinaryError[M]()(implicit evidence$1: Monoid[M]) extends FrequencyError[Boolean, M, Map[Int, (M, M)]] with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, FrequencyError[Boolean, M, Map[Int, (M, M)]], Error[Map[Boolean, M], Map[Boolean, Double], Map[Int, (M, M)]], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BinnedBinaryError
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. FrequencyError
  7. Error
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BinnedBinaryError()(implicit arg0: Monoid[M])

    Permalink

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 auc(err: Map[Int, (M, M)])(implicit num: Numeric[M]): Double

    Permalink

  6. def clone(): AnyRef

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

  7. def create(actual: Map[Boolean, M], predicted: Map[Boolean, Double]): Map[Int, (M, M)]

    Permalink

    create an single component of the error value

    create an single component of the error value

    actual

    the actual target distribution from the validation set

    predicted

    the set of predicted distributions from the trees

    Definition Classes
    FrequencyError → Error

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

    Permalink
    Definition Classes
    AnyRef

  9. def error(label: Boolean, count: M, probabilities: Map[Boolean, Double]): Map[Int, (M, M)]

    Permalink
    Definition Classes
    BinnedBinaryError → FrequencyError

  10. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  13. lazy val monoid: Monoid[Map[Int, (M, M)]]

    Permalink
    Definition Classes
    BinnedBinaryError → FrequencyError

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

    Permalink
    Definition Classes
    AnyRef

  15. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  16. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. val semigroup: Monoid[Map[Int, (M, M)]]

    Permalink

    semigroup to sum up error values

    semigroup to sum up error values

    Definition Classes
    FrequencyError → Error

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

    Permalink
    Definition Classes
    AnyRef

  19. def thresholds(err: Map[Int, (M, M)])(implicit num: Numeric[M]): List[(Int, ConfusionMatrix)]

    Permalink

  20. final def wait(): Unit

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

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

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

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

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from FrequencyError[Boolean, M, Map[Int, (M, M)]]

Inherited from Error[Map[Boolean, M], Map[Boolean, Double], Map[Int, (M, M)]]

Inherited from AnyRef

Inherited from Any

Ungrouped