Module common 

The rules that define the DL8.5 problem, plus the time limit. None of them is relaxable except, optionally, the time limit.

Structs

LowerBoundRule

Stops at nodes whose lower bound reaches the upper bound, or whose upper bound is zero: no subtree there can improve the parent.

MaxDepthRule

Turns nodes at the maximum depth into leaves.

MinSupportRule

Turns nodes with fewer than min_support instances into leaves.

PureNodeRule

Turns nodes with zero error as a leaf into leaves.

SimilarityLowerBoundRule

Applies the similarity lower bound of DL8.5: stops when the bound reaches the upper bound, makes the node a leaf when the leaf meets the bound, and stops when the best tree found meets it.

TimeLimitRule

Stops the search once the time limit is reached.

UsableNodeRule

Stops at nodes already solved in an earlier visit: a complete search found their error at or below its bound, so it is their optimum. Always active.