In this paper incomplete data are assumed to be decision tables with missing attribute values. We discuss two main cases of missing attribute values: lost values (a value was recorded but it is unavailable) and "do not care" conditions (the original values were irrelevant). Through the entire paper the same calculus, based on computations of blocks of attribute-value pairs, is used. Complete data are characterized by the indiscernibility relations, a basic idea of rough set theory. Incomplete data are characterized by characteristic relations. Using characteristic relations, lower and upper approximations are generalized for incomplete data. Finally, from three definitions of such approximations certain and possible rule sets may be induced.
CITATION STYLE
Grzymala-Busse, J. W. (2004). Rough set approach to incomplete data. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3070, pp. 50–55). Springer Verlag. https://doi.org/10.1007/978-3-540-24844-6_7
Mendeley helps you to discover research relevant for your work.