Generalized rules in incomplete information systems
In the paper we define a notion of a generalized decision rule in a system with incomplete information. A generalized rule may be indefinite. A definite generalized rule is called certain. A rule is defined as generalized in an incomplete system if it is generalized in every completion of the incomplete system. Careful examination of the dependencies between an incomplete system and its completions allow us to state that all optimal generalized rules can be generated from the initial incomplete system. We show how to compute such rules by means of Boolean reasoning.
KeywordsKnowledge Discovery Incomplete Information Systems Rough Sets
Unable to display preview. Download preview PDF.
- Kononenko I., Bratko I., Roskar E., Experiments in Automatic Learning of Medical Diagnostic Rules, Technical Report, Jozef Stefan Institute, Ljubljana, Yugoslavia, 1984.Google Scholar
- Quinlan J.R., Induction of Decision Trees, in Readings in Machine Learning, Shavlik J.W., Dietterich T.G. (ed.), 1990, Morgan Kaufmann Publishers, pp. 57–69.Google Scholar
- Pawlak Z., Rough Sets: Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, Vol. 9, 1991.Google Scholar
- Chmielewski M.R., Grzymala-Busse J.W., Peterson N.W., Than S., The Rule Induction System LERS — A Version for Personal Computers, Foundations of Computing and Decision Sciences, Vol. 18 No. 3-4, 1993, pp. 181–212.Google Scholar
- Slowinski R., Stefanowski J., Rough-Set Reasoning about Uncertain Data, in Fundamenta Informaticae, Vol. 27, No. 2-3, 1996, pp. 229–244.Google Scholar
- Kryszkiewicz M., Rules in Incomplete Information Systems, submitted for Journal of Information Science.Google Scholar
- Kryszkiewicz M., Rough Set Approach to Incomplete Information Systems, Proceedings of Second Annual Joint Conference on Information Sciences: Fuzzy Logic, Neural Computing, Pattern Recognition, Computer Vision, Evolutionary Computing, Information Theory, Computational Intelligence, Wrightsville Beach, North Carolina, USA, 28 September–1 October 1995, pp. 194–197; the extended version of the paper is accepted for Journal ofInformation Science.Google Scholar
- Lipski W.J., On Semantic Issues Connected with Incomplete Information Databases, ACM Transaction on Databases Systems, 4, 1979, pp. 262–296.Google Scholar
- Skowron A., Rauszer C., The Discernibility Matrices and Functions in Information Systems, in Intelligent Decision Support: Handbook of Applications and Advances of Rough Sets Theory, Slowinski R. (ed. ), 1992, Kluwer Academic Publisher, pp.331–362.Google Scholar
- Nguyen S.H., Nguyen H.S., Some Efficient Algorithms for Rough Set Methods, in Proceedings of Sixth Intl. Conference IPMU '96, July 1–5, Granada, Espana, Vol. 3, 1996, pp. 1451–1456.Google Scholar