Rough set approach under dynamic granulation in incomplete information systems

  • Authors:

  • Yuhua Qian;Jiye Liang;Xia Zhang;Chuangyin Dang

  • Affiliations:

  • Sch. of Comp. and Inf. Techn., Shanxi Univ., Shanxi, China and Key Lab. of Computational Int. and Chinese Inf. Processing of Ministry of Edu., Taiyuan, Shanxi, China and Dept. of Manufacturing Eng ...;School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China and Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Educatio ...;School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi, China and Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Educatio ...;Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, Hong Kong

  • Venue:
  • MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, the concept of a granulation order is proposed in an incomplete information system. Positive approximation of a set under a granulation order is defined and its some useful properties are investigated. Unlike classical rough set, this approach focuses on how to describe the structure of a rough set in incomplete information systems. For a subset of the universe, its approximation accuracy is monotonously increasing under a granulation order. This means that a proper family of granulations can be chosen for a target-concept approximation according to user requirements.