Int. J. of Granular Computing, Rough Sets and Intelligent Systems   »   2011 Vol.2, No.1

 

 

Title: Tolerance granular computing towards incomplete information system

 

Author: Zhongzhi Shi, Wenjia Niu, Zuqiang Meng, Yuan Lu

 

Addresses:
Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, P.O. Box 2704-28, No. 6 Kexueyuan Nanlu, Beijing 100190, China.
High Performance Network Laboratory, Institute of Acoustics, No. 6 Kexueyuan Nanlu, Beijing 100190, China.
College of Computer, Electronics and Information, Guangxi University, Nanning 530004, China.
College of Computer, Electronics and Information, Guangxi University, Nanning 530004, China

 

Abstract: Traditional granular computing (GrC) is mainly divided into three categories: computing with words (CW), computing with rough set (RS) and computing with quotient space (QS). However, through the analysis of essential characteristic of GrC, it is not difficult to find that CW is based on fuzzy granules and both RS and QS are based on disjoint granules, which essentially are equivalence classes, either equal to each other or with empty overlap. In fact, intersecting granules widely exist in most applications and should not be ignored. Therefore, for computing with intersecting granules, there is another kind of GrC which is referred to as tolerance GrC (TGrC). On the basis of our former work about TGrC, this paper further proposed an extended TGrC model towards the incomplete information system through constructing both Boolean algebra on super-granular space and decision algebraic system. The case study and analysis are also provided to demonstrate the validity of our approach.

 

Keywords: granular computing; GrC; tolerance GrC; TGrC; rough sets; quotient space; incomplete information; fuzzy granules; disjoint granules.

 

DOI: 10.1504/IJGCRSIS.2011.041457

 

Int. J. of Granular Computing, Rough Sets and Intelligent Systems, 2011 Vol.2, No.1, pp.10 - 22

 

Date of acceptance: 24 Jan 2011
Available online: 23 Jul 2011

 

 

Editors Full text accessAccess for SubscribersPurchase this articleComment on this article