Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Guan, Y.: Set-valued information systems. Information Sciences 176, 2507–2525 (2006)
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)
Jaworski, W.: Generalized indiscernibility relations: applications for missing values and analysis of structural objects. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets VIII. LNCS, vol. 5084, pp. 116–145. Springer, Heidelberg (2008)
Kryszkiewicz, M.: Rough set approach to incomplete information systems. Information Sciences 112, 39–49 (1998)
Kryszkiewicz, M.: Rules in incomplete information systems. Information Sciences 113, 271–292 (1999)
Zhao, Y., Yao, Y.Y., Luo, F.: Data analysis based on discernibility and indiscernibility. Information Sciences 177, 4959–4976 (2007)
Leung, Y., Li, D.: Maximal consistent block technique for rule acquisition in incomplete information systems. Information Sciences 153, 85–106 (2003)
Witold Lipski, J.R.: On semantic issues connected with incomplete information databases. ACM Transactions on Database Systems 4, 262–296 (1979)
Nakamura, A.: A rough logic based on incomplete information and its applicaton. International Journal of Approximate Reasoning 15, 367–378 (1996)
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)
Pawlak, Z.: Information systems theoretical foundations. Information Systems 6, 205–218 (1981)
Wang, G.: Extension of rough set under incomplete information systems. Journal of Computer Research and Development 39, 1238–1243 (2002)
Zhang, W.: Incomplete information system and its optimal selections. Computers and Mathematics with Applications 48, 691–698 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, R., Yao, Y. (2010). Indiscernibility and Similarity in an Incomplete Information Table. In: Yu, J., Greco, S., Lingras, P., Wang, G., Skowron, A. (eds) Rough Set and Knowledge Technology. RSKT 2010. Lecture Notes in Computer Science(), vol 6401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16248-0_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-16248-0_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16247-3
Online ISBN: 978-3-642-16248-0
eBook Packages: Computer ScienceComputer Science (R0)