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.
2016 IEEE 26th International Workshop on Machine Learning for Signal Processing (MLSP) , pages =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative 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.