Optimization of Approximate Decision Rules Relative to Length
In the paper, a modified dynamic programming approach for optimization of decision rules relative to length is studied. Experimental results connected with length of approximate decision rules, size of a directed acyclic graph, and accuracy of classifiers, are presented.
KeywordsDecision rules Dynamic programming approach Optimization Length
- 3.Asuncion, A., Newman, D.J.: UCI Machine Learning Repository (2007). http://www.ics.uci.edu/~mlearn/