A Threshold-based Similarity Relation Under Incomplete Information

  • Xuri Yin
Conference paper
Part of the The International Federation for Information Processing book series (IFIPAICT, volume 258)

The conventional rough set theory based on complete information systems stems from the observation that objects with the same characteristics are indiscernible according to available information. Although rough sets theory has been applied in many fields, the use of the indiscernibility relation may be too rigid in some real situations. Therefore, several generalizations of the rough set theory have been proposed some of which extend the indiscernibility relation using more general similarity or tolerance relations. In this paper, after discussing several extension models based on rough sets for incomplete information, a novel relation based on thresholds is introduced as a new extension of the rough set theory, the upper-approximation and the lower approximation defined on this relation are proposed as well. Furthermore, we present the properties of this extended relation. The experiments show that this relation works effectively in incomplete information and generates rational object classification.


rough sets incomplete information tolerance relation similarity relation constrained dissymmetrical similarity relation 


  1. Chmielewski, M.R., Grzymala-Busse, et al. (1998). The rule induction system LERS-A version for personal computers. Found Compute Decision Sciences, 3/4: 181-212.Google Scholar
  2. Kryszkiewicz, M. Rough set approach to incomplete information systems. (1998). Information Sciences, 1-4: 39-49.CrossRefGoogle Scholar
  3. Kryszkiewicz, M. Rules in incomplete information system. (1999). Information Sciences, 4: 271-292.CrossRefGoogle Scholar
  4. Pawlak Z. Rough sets. (1982). International Journal of Information and Computer Science, 5: 341-356.Google Scholar
  5. Stefanowski, J., Tsoukias, A. (1999). On the extension of rough sets under Incomplete Information. In: Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing, Yamaguchi: Physica-Verlag, 73-81.Google Scholar
  6. Wang G.Y. (2002). Extension of rough set under incomplete information systems. Journal of Computer Research and Development, 10: 1238-1243 (in Chinese).Google Scholar
  7. Yin, X.R, Jia, X.Y., Shang, L. (2006). A New Extension Model of Rough Set Under Incomplete Information. In: Proceedings of the First International Conference on Rough Sets and Knowledge Technology, LNAI 4062, Springer-Verlag Berlin Heidelberg, 141-146.CrossRefGoogle Scholar
  8. Yin, X.R, Zhou, Z.H., Li, N., Chen, S.F. (2001). An approach for data filtering based on rough set theory. In: Proceedings of the Second International Conference on Web-age Information Management. LNCS 2118, Springer-Verlag Berlin Heidelberg, 367-374.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Xuri Yin
    • 1
  1. 1.Simulation Laboratory of Military TrafficInstitute of AutomobileChina

Personalised recommendations