Tolerance granular computing towards incomplete information system Online publication date: Sat, 28-Feb-2015
by Zhongzhi Shi, Wenjia Niu, Zuqiang Meng, Yuan Lu
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 2, No. 1, 2011
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook