com.eharmony.aloha.models.tree.decision
Find the deepest node in the tree possible, given the data (in v), on which to branch.
Find the deepest node in the tree possible, given the data (in v), on which to branch. Progress down the decision tree until no further progress can be made and return the node.
scala.Right [ com.eharmony.aloha.models.tree.decision.Leaf ] when a leaf is reached or scala.Left [InteriorNodeResult] when progress down the tree was stopped prior to reaching a leaf node. The node in the InteriorNodeResult is the last node in which we could make a successful choice.
the input whose data is used to branch down the decision tree.
either a scala.Right [ com.eharmony.aloha.models.tree.decision.Leaf ] representing a leaf node in the tree or a scala.Left with a node where no further progress down the tree could be made and an optional sequence of log messages.
Get a NON thread-safe iterator over the nodes in the tree for a DFS ordering.
Get a NON thread-safe iterator over the nodes in the tree for a DFS ordering. Each iterator value contains the node in the tree and the depth (root has 0 depth). This iterator requires O(B * D) auxiliary space where B is the branching factor and D is the tree depth.
a NON thread-safe iterator over the nodes in the tree for a DFS ordering.
A simple representation of a decision tree node. It is just like a com.eharmony.aloha.models.tree.Tree except that it has a way of choosing a descendant, given an input.
the type of node in the decision tree.
the domain of the childSelector function