Log In
Communities & Collections
All of KAUST
About
Home
Research
Conference Papers
Decision rules for decision tables with many-valued decisions
Decision rules for decision tables with many-valued decisions
Type
Conference Paper
Authors
Chikalov, Igor
Zielosko, Beata
KAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Date
2011
Abstract
In the paper, authors presents a greedy algorithm for construction of exact and partial decision rules for decision tables with many-valued decisions. Exact decision rules can be 'over-fitted', so instead of exact decision rules with many attributes, it is more appropriate to work with partial decision rules with smaller number of attributes. Based on results for set cover problem authors study bounds on accuracy of greedy algorithm for exact and partial decision rule construction, and complexity of the problem of minimization of decision rule length. © 2011 Springer-Verlag.
Citation
Chikalov, I., & Zielosko, B. (2011). Decision Rules for Decision Tables with Many-Valued Decisions. Lecture Notes in Computer Science, 763–768. doi:10.1007/978-3-642-24425-4_95
Publisher
Springer Nature
Journal
Rough Sets and Knowledge Technology
Conference/Event Name
6th International Conference on Rough Sets and Knowledge Technology, RSKT 2011
DOI
10.1007/978-3-642-24425-4_95
Permanent link to this record
http://hdl.handle.net/10754/564344
Collections
Conference Papers
Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division
Full item page