Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications
Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications
Dynamic Programming Approach for Partial Decision Rule Optimization
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Dynamic programming approach to optimization of approximate decision rules
Information Sciences: an International Journal
Hi-index | 0.00 |
We describe an online learning algorithm that builds a system of decision rules for a classification problem. Rules are constructed according to the minimum description length principle by a greedy algorithm or using the dynamic programming approach.