Abstract
We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relationships between rough set reducts and boolean prime implicants.
Preview
Unable to display preview. Download preview PDF.
References
Brown, E.M.: Boolean Reasoning. Kluwer Academic Publishers, Dordrecht (1990).
Pawlak, Z.: Rough sets Theoretical aspects of reasoning about data. Kluwer Academic Publishers, Dordrecht (1991).
Pawlak, Z.: Decision rules, Bayes' rule and rough sets. In: N. Zhong, A. Skowron and S. Ohsuga (eds.), Proc. of the Seventh International WorkshopRSFDGrC'99, Yamaguchi, Japan, LNAI 1711 (1999) pp. 1–9.
Pawlak, Z., Skowron, A.: Rough membershipfunctions. In: R.R. Yaeger, M. Fedrizzi, and J. Kacprzyk (eds.), Advances in the Dempster Shafer Theory of Evidence, John Wiley & Sons, Inc., New York, Chichester, Brisbane, Toronto, Singapore (1994) pp. 251–271.
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann (1988).
Polkowski, L., Skowron, A. (eds.): Rough Sets in Knowledge Discovery, parts 1, 2, Heidelberg, Physica-Verlag (1998) pp. 321–365.
Skowron, A.: Boolean reasoning for decision rules generation. In: Proc. of the Seventh International Symposium ISMIS'93, Trondheim, Norway, 1993; J. Komorowski, Z. Ras (eds.), LNAI 689, Springer-Verlag (1993) pp. 295–305.
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: R. SKlowiński (ed.), Intelligent Decision Support. Handbook of Applications and Advances of the Rough Set Theory, Kluwer Academic Publishers, Dordrecht (1992) pp. 311–362.
Ślec,zak, D.: Various approaches to reasoning with frequency-based decision reducts: a survey. In: L. Polkowski, S. Tsumoto, T.Y. Lin (eds.), Rough Sets in Soft Computing and Knowledge Discovery: New Developments, Physica-Verlag / Springer-Verlag (2000).
Ziarko, W.: Decision Making with Probabilistic Decision Tables. In: N. Zhong, A. Skowron and S. Ohsuga (eds.), Proc. of the Seventh International Workshop RSFDGrC'99, Yamaguchi, Japan, LNAI 1711 (1999) pp. 463–471.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borkowski, M., Ślęzak, D. (2001). Application of Discernibility Tables to Calculation of Approximate Frequency Based Reducts. In: Ziarko, W., Yao, Y. (eds) Rough Sets and Current Trends in Computing. RSCTC 2000. Lecture Notes in Computer Science(), vol 2005. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45554-X_14
Download citation
DOI: https://doi.org/10.1007/3-540-45554-X_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43074-2
Online ISBN: 978-3-540-45554-7
eBook Packages: Springer Book Archive