com.eharmony.aloha.models.tree

decision

package decision

Linear Supertypes
EitherHelpers, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. decision
  2. EitherHelpers
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. 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.

  2. trait DecisionTreeBoolToOptBoolConversions extends AnyRef

  3. trait DecisionTreeJson extends AnyRef

  4. type ENS[+A] = Either[Seq[String], A]

    Either of Non-empty Seq (Like poor man's version of ValidationNel from scalaz)

    Either of Non-empty Seq (Like poor man's version of ValidationNel from scalaz)

    Attributes
    protected[this]
    Definition Classes
    EitherHelpers

  5. case class InteriorNode[-A, +B](value: B, descendants: IndexedSeq[Node[A, B]], nodeSelector: NodeSelector[A]) extends Node[A, B] with Product with Serializable

  6. case class Leaf[+B](value: B) extends Node[Any, B] with Product with Serializable

    Representation of a decision tree leaf node.

  7. case class LinearNodeSelector[-A](predicates: List[GenAggFunc[A, Option[Boolean]]], missingDataOk: Boolean = false) extends NodeSelector[A] with EitherHelpers with Product with Serializable

    A linear time node selection algorithm that is based on applying the predicates in order to the input datum and selecting the first node whose associated predicate succeeds.

  8. 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.

  9. sealed trait Node[-A, +B] extends Tree[B, IndexedSeq, Node[A, B]]

    A simple representation of a decision tree node.

  10. case class RandomNodeSelector[-A](features: Seq[GenAggFunc[A, Any]], distribution: HashedCategoricalDistribution, missingOk: Boolean = false) extends NodeSelector[A] with Product with Serializable

    A selector that random selects a child node.

Value Members

  1. object BasicDecisionTree extends ParserProviderCompanion with Serializable

  2. object DecisionTreeBoolToOptBoolConversions extends DecisionTreeBoolToOptBoolConversions

  3. object LinearNodeSelector extends Serializable

  4. object ModelDecisionTree extends ParserProviderCompanion with Serializable

  5. object Node

    Provides factory methods for creating Decision Tree nodes.

  6. def fromValidationNel[A](v: ValidationNel[String, A]): ENS[A]

    Attributes
    protected[this]
    Definition Classes
    EitherHelpers

  7. def mapSeq[A, B](l: Seq[A])(f: (A) ⇒ ENS[B]): ENS[Seq[B]]

    Like l.

    Like l.map(f).sequence[({type L[+A] = Either[Seq[String], A]})#L, C ] in scalaz except that it short circuits if it finds an error. (There must be some better way to do this w/ scalaz).

    If we put a println("folding") at the top of the inner function h, we would get the following:

    scala> mapSeq(Left(Seq("1")) +: (2 to 3).map(Right(_)))(identity)  // Only 1 "folding" instead of 3.
folding
res0: ENS[Seq[Int]] = Left(List(0))

scala> mapSeq((1 to 3).map(Right(_)))(identity)
folding
folding
folding
res1: ENS[Seq[Int]] = Right(List(1, 2, 3))
    A

    type of values in the input sequence in the first parameter list.

    B

    type of values in the output sequence if successful.

    l

    list of values to which f should be applied.

    f

    function to map over l

    returns

    Attributes
    protected[this]
    Definition Classes
    EitherHelpers

  8. def toValidationNel[A](e: ENS[A]): ValidationNel[String, A]

    Attributes
    protected[this]
    Definition Classes
    EitherHelpers

Inherited from EitherHelpers

Inherited from AnyRef

Inherited from Any

Ungrouped