Abstract
This work has two objectives: first, to introduce rough set theory, developed by Pawlak, to a wider audience; second, to present computational methods for the theory, allowing it to be implemented in many more systems. Rough set theory is a new mathematical tool to deal with vagueness and uncertainty. This approach seems to be of fundamental importance to artificial intelligence and cognitive sciences. Although the burgeoning methodology has been successful in many real- life applications, there are still several theoretical problems to be solved. We need a practical approach to apply the theory. Some problems, for example, the general problem of finding all reducts, are NP-hard. Thus, it is important to investigate computational methods for the theory. We present computational methods for the theory of rough sets and knowledge discovery in databases. Emphasizing applications, we illustrate our methods by means of running examples using data of flu diagnosis.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. G. Bazan, A comparison of dynamic and non-dynamic rough set methods for extracting laws from decision tables, in L. Polkowski, A. Skowron (eds.)Rough sets in knowledge discovery, Vol.1,Physisca Verlag, 1998, 321–365.
Z. Pawlak, Rough sets: theoretical aspects of reasoning about data. Kluwer, Dordrecht, Netherland, 1991.
Z. Pawlak, J. Grzymala-Busse, R. Slowinski, and W. Ziarko, Rough sets. CACM, 38(11):89–95, 1995.
R. Susmaga, Experiments in incremental computation of reducts, in L. Polkowski, A. Skowron (eds.) Rough sets in knowledge discovery, Vol.1, Physisca Verlag, 1998, 530–533.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guan, J.W., Bell, D.A. (1999). Rough Knowledge Discovery and Applications. In: Hunter, A., Parsons, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1999. Lecture Notes in Computer Science(), vol 1638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48747-6_17
Download citation
DOI: https://doi.org/10.1007/3-540-48747-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66131-3
Online ISBN: 978-3-540-48747-0
eBook Packages: Springer Book Archive