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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Cheriyan, J., Ravi, R.: Lecture notes on approximation algorithms for network problems (1998), http://www.math.uwaterloo.ca/jcheriya/lecnotes.html
Feige, U.: A threshold of ln n for approximating set cover (Preliminary version). In: Proc. 28th Annual ACM Symposium on the Theory of Computing, pp. 314–318 (1996)
Moshkov, M., Piliszczuk, M., Zielosko, B.: Partial Covers, Reducts and Decision Rules in Rough Sets: Theory and Applications. SCI, vol. 145. Springer, Heidelberg (2008)
Pawlak, Z.: Rough Sets—Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Ślęzak, D.: Approximate entropy reducts. Fundam. Inform. 53, 365–390 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chikalov, I., Zielosko, B. (2011). Decision Rules for Decision Tables with Many-Valued Decisions. In: Yao, J., Ramanna, S., Wang, G., Suraj, Z. (eds) Rough Sets and Knowledge Technology. RSKT 2011. Lecture Notes in Computer Science(), vol 6954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24425-4_95
Download citation
DOI: https://doi.org/10.1007/978-3-642-24425-4_95
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24424-7
Online ISBN: 978-3-642-24425-4
eBook Packages: Computer ScienceComputer Science (R0)