Find the LeafNodes that best fit row in the tree.
Find the LeafNodes that best fit row in the tree. Generally, the
path from node to the resulting leaf node will be along *only* true
predicates. However, when multiple predicates are true in a
SplitNode, the actual choice of which ones gets traversed is left to
the particular implementation of TreeTraversal.
the initial node to start from
the row/instance we're trying to match with a leaf node
the leaf nodes that match the row
Limit the maximum number of leaves returned from find to n.
Find the LeafNodes that best fit row in the tree.
Find the LeafNodes that best fit row in the tree. Generally, the
path from tree.root to the resulting leaf node will be along *only*
true predicates. However, when multiple predicates are true in a
SplitNode, the actual choice of which ones gets traversed is left to
the particular implementation of TreeTraversal.
the decision tree to search in
the row/instance we're trying to match with a leaf node
the leaf nodes that best match the row
A
TreeTraversalprovides a way to find all of the leaves in a tree that some row can evaluate to. Specifically, there may be cases where multiple predicates in a single split node returntruefor a given row (eg missing features). A tree traversal chooses which paths to go down (which may be all of them) and the order in which they are traversed.