Generalized rules in incomplete information systems
AbstractIn 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.
|Book||Raś Zbigniew W, Skowron Andrzej (eds.): Foundations of Intelligent Systems, , Lecture Notes in Artificial Intelligence, vol. LNAI 1325, 1997, Springer, ISBN 3-540-63614-5, 630 p., DOI:10.1007/3-540-63614-5|
|Keywords in English||Knowledge Discovery - Incomplete Information Systems - Rough Sets|
|Publication indicators||= 8|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.