Class/Object

com.eharmony.aloha.models.tree.decision

ModelDecisionTree

Related Docs: object ModelDecisionTree | package decision

Permalink

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

A decision tree containing models at the nodes. The evaluation algorithm works as follows:

If a

The benefit to this is that we report which submodel was responsible for producing the score.

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. ModelDecisionTree
  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
Visibility
  1. Public
  2. All

Instance Constructors

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

    Permalink

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

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

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

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

    Permalink
    Definition Classes
    ModelDecisionTreeSubmodelBase
  8. def clone(): AnyRef

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

    Permalink

    Recursively close the submodels.

    Recursively close the submodels.

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

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

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

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

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

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

    Permalink
    Definition Classes
    Any
  16. val modelId: ModelIdentity

    Permalink

    An id with which to identify this model

    An id with which to identify this model

    Definition Classes
    ModelDecisionTreeIdentifiable
  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. def processInterior(a: A, interior: InteriorNodeResult[A, Submodel[N, A, U]]): Subvalue[B, N]

    Permalink
    Attributes
    protected[this]
  21. def processLeaf(a: A, m: Leaf[Submodel[N, A, U]]): Subvalue[B, N]

    Permalink
    Attributes
    protected[this]
  22. val returnBest: Boolean

    Permalink

    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, Submodel[N, A, U]]

    Permalink

    the root node of the decision tree

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

    Permalink
    Definition Classes
    ModelDecisionTreeSubmodel
  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]

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

    Permalink
    Definition Classes
    AnyRef
  27. def toString(): String

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  30. 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 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