Indiscernibility and Similarity in an Incomplete Information Table
A new method is proposed for interpreting and constructing relationships between objects in an incomplete information table. An incomplete information table is expressed as a family of complete tables. One can define an indiscernibility relation for each complete table and then get a family of indiscernibility relations of all complete tables. A pair of an indiscernibility and a similarity relation is constructed by the intersection and union of this family of indiscernibility relation. It provides a clear semantic interpretation for relationship between objects of an incomplete information table. In fact, it is a pair of bounds of the actual indiscernibility relation if all values in the incomplete table were known.
KeywordsIncomplete information table completion indiscernibility relation similarity relation
Unable to display preview. Download preview PDF.
- 2.Grzymala-Busse, J.W., Hu, M.: A comparison of several approaches to missing attribute values in data mining. In: Ziarko, W., Yao, Y. (eds.) Proceedings of the Second International Conference on Rough Sets and Current Trends in Computing, pp. 378–385. Physica-Verlag, Heidelberg (2001)CrossRefGoogle Scholar
- 10.Orlowska, E.: Introduction: what you always wanted to know about rough sets. In: Orlowska, E. (ed.) Incomplete Information: Rough Set Analysis, pp. 1–20. Physica-Verlag, Heidelberg (1998)Google Scholar
- 12.Wang, G.: Extension of rough set under incomplete information systems. Journal of Computer Research and Development 39, 1238–1243 (2002)Google Scholar