2014 | OriginalPaper | Chapter
Optimization of Decision Rules Relative to Coverage - Comparative Study
Author : Beata Zielosko
Published in: Rough Sets and Intelligent Systems Paradigms
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In the paper, we present a modification of the dynamic programming algorithm for optimization of decision rules relative to coverage. The aims of the paper are: (i) study of the coverage of decision rules, and (ii) study of the size of a directed acyclic graph (the number of nodes and edges), for a proposed algorithm. The paper contains experimental results with decision tables from UCI Machine Learning Repository.