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 into leaves.

SimilarityLowerBoundRule

Applies the similarity lower bound of DL8.5: stops when the bound reaches the upper bound, and makes the node a leaf when its error already meets the bound.

TimeLimitRule

Stops the search once the time limit is reached.

UsableNodeRule

Stops at nodes already solved in an earlier visit: their error and the bound they were solved under are both known. Always active.