The paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to length, coverage and number of misclassifications. Presented algorithm constructs a directed acyclic graph Δγ(T) which nodes are subtables of the decision table T. Based on the graph Δγ(T) we can describe all irredundant γ-decision rules with minimum length, after that among these rules describe all rules with maximum coverage, and among such rules describe all rules with minimum number of misclassifications. We can also change the set of cost functions and order of optimization. Sequential optimization can be considered as tool that help to construct simpler rules for understanding and interpreting by experts.
|Original language||English (US)|
|Title of host publication||2012 Federated Conference on Computer Science and Information Systems (FedCSIS)|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|State||Published - 2012|
Bibliographical noteKAUST Repository Item: Exported on 2020-10-01
Acknowledgements: The author would like to thank you Prof. Mikhail Moshkov, Dr. Igor Chikalov and Talha Amin for possibility to use results
of Dagger software system