DECISION RULE OPTIMIZATION ON THE BASIS OF DYNAMIC PROGRAMMING METHODS |
6 | |
2010 |
scientific article | 519.712 | ||
195-200 | decision table, decision rule, dynamic programming, greedy algorithm |
On the basis of dynamic programming methods, a new approach to minimization of the approximate decision rule
length is considered. A modification of this approach is discussed which uses an upper bound on the decision rule minimum
length obtained by the greedy algorithm. |
![]() |