com.eharmony.aloha.models.tree.decision

BasicDecisionTree

case class BasicDecisionTree[U, N, -A, +B <: U](modelId: ModelIdentity, root: Node[A, N], returnBest: Boolean, auditor: Auditor[U, N, B]) extends SubmodelBase[U, N, A, B] with Product with Serializable

A decision tree whose node values are the values returned by this model.

A

model input type

B

model output type

modelId

An id with which to identify this model

root

the root node of the decision tree

returnBest

if no path from the root to a leaf can be generated for a given input, should we return a score associated with an interior node?

Linear Supertypes
Serializable, Serializable, Product, Equals, SubmodelBase[U, N, A, B], Model[A, B], (A) ⇒ B, Submodel[N, A, B], Closeable, AutoCloseable, Identifiable[ModelIdentity], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. BasicDecisionTree
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. SubmodelBase
  7. Model
  8. Function1
  9. Submodel
  10. Closeable
  11. AutoCloseable
  12. Identifiable
  13. AnyRef
  14. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new BasicDecisionTree(modelId: ModelIdentity, root: Node[A, N], returnBest: Boolean, auditor: Auditor[U, N, B])

    modelId

    An id with which to identify this model

    root

    the root node of the decision tree

    returnBest

    if no path from the root to a leaf can be generated for a given input, should we return a score associated with an interior node?

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. def andThen[A](g: (B) ⇒ A): (A) ⇒ A

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  7. final def apply(a: A): B

    Definition Classes
    SubmodelBase → Function1
  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. val auditor: Auditor[U, N, B]

    Definition Classes
    BasicDecisionTreeSubmodelBase
  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def close(): Unit

    Definition Classes
    SubmodelBase → Closeable → AutoCloseable
  12. def compose[A](g: (A) ⇒ A): (A) ⇒ B

    Definition Classes
    Function1
    Annotations
    @unspecialized()
  13. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  14. def failure(errorMsgs: ⇒ Seq[String] = Nil, missingVarNames: ⇒ Set[String] = Set.empty, subvalues: Seq[U] = Nil): Subvalue[B, N]

    Attributes
    protected[this]
    Definition Classes
    SubmodelBase
  15. def finalize(): Unit

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

    Definition Classes
    AnyRef → Any
  17. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  18. val modelId: ModelIdentity

    An id with which to identify this model

    An id with which to identify this model

    Definition Classes
    BasicDecisionTreeIdentifiable
  19. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  20. final def notify(): Unit

    Definition Classes
    AnyRef
  21. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  22. val returnBest: Boolean

    if no path from the root to a leaf can be generated for a given input, should we return a score associated with an interior node?

  23. val root: Node[A, N]

    the root node of the decision tree

  24. def subvalue(a: A): Subvalue[B, N]

    Produce a score.

    Produce a score.

    a

    an input to the model representing covariate data.

    returns

    a Tuple2 whose first field represents a simple version of the score, the second field (that should be a Some instance if audit is true) is a more involved reporting of the score including errors and all sub-model scores.

    Definition Classes
    BasicDecisionTreeSubmodel
  25. def success(naturalValue: N, errorMsgs: ⇒ Seq[String] = Nil, missingVarNames: ⇒ Set[String] = Set.empty, subvalues: Seq[U] = Nil, prob: ⇒ Option[Float] = None): Subvalue[B, N]

    Attributes
    protected[this]
    Definition Classes
    SubmodelBase
  26. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  27. def toString(): String

    Definition Classes
    Function1 → AnyRef → Any
  28. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from SubmodelBase[U, N, A, B]

Inherited from Model[A, B]

Inherited from (A) ⇒ B

Inherited from Submodel[N, A, B]

Inherited from Closeable

Inherited from AutoCloseable

Inherited from Identifiable[ModelIdentity]

Inherited from AnyRef

Inherited from Any

Ungrouped