Optimization and analysis of decision trees and rules: dynamic programming approach (Q5326154): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/03081079.2013.798902
+Normal rank
@@ Property / OpenAlex ID @@
+W2051855544
@@ Property / OpenAlex ID: W2051855544 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic programming approach to optimization of approximate decision rules
+Normal rank
@@ Property / cites work @@
+Q3327527
@@ Property / cites work: Q3327527 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions
+Normal rank
@@ Property / cites work @@
+Optimal Binary Identification Procedures
@@ Property / cites work: Optimal Binary Identification Procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing optimal binary decision trees is NP-complete
+Normal rank
@@ Property / cites work @@
+Optimizing decision trees through heuristically guided search
+Normal rank
@@ Property / cites work @@
+Q4003537
@@ Property / cites work: Q4003537 / rank @@
+Normal rank
@@ Property / cites work @@
+Rough sets and Boolean reasoning
@@ Property / cites work: Rough sets and Boolean reasoning / rank @@
+Normal rank
@@ Property / cites work @@
+The synthetic approach to decision table conversion
+Normal rank