OPDT uses mixed-integer programming to identify an optimal symbolic rule that maximizes coverage while minimizing false positives for binary classification, with support for domain constraints via Branching Structure Constraints.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
citing papers explorer
-
Optimal Pattern Detection Tree for Symbolic Rule-Based Classification
OPDT uses mixed-integer programming to identify an optimal symbolic rule that maximizes coverage while minimizing false positives for binary classification, with support for domain constraints via Branching Structure Constraints.