Summary
In 1991 there were defined basic functions of the evidence theory based on the concepts of the rough set theory. In this paper we use these functions in specifying minimal templates of decision tables. The problem of finding such templates is NP-hard. Hence, we propose some heuristics based on genetic algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Friedman, J.H. and Hastie, T., and Tibshirani, R.: The elements of statistical learning: Data mining, inference, and prediction. Springer, Heidelberg 2001.
Pawlak, Z.: Rough Sets: Theoretical aspects of reasoning about data. Boston: Kluwer Academic Publishers (1991).
Shafer, G.: A mathematical theory of evidence. Princeton University Press (1976).
Skowron, A. and Grzymala-Busse, J.: From the Rough Set Theory to the Evidence Theory. In R.R. Yager, M. Fedrizzi, J. Kacprzyk (eds.), Advances in the Dempster-Shafer Theory of Evidence. New York: Wiley (1994) 193–236.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marszał-Paszek, B., Paszek, P. (2005). Extracting Minimal Templates in a Decision Table. In: Monitoring, Security, and Rescue Techniques in Multiagent Systems. Advances in Soft Computing, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32370-8_27
Download citation
DOI: https://doi.org/10.1007/3-540-32370-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23245-2
Online ISBN: 978-3-540-32370-9
eBook Packages: EngineeringEngineering (R0)