Generalisation of rough set for rule induction in incomplete system
by Xibei Yang, Xiaoning Song, Xiaohua Hu
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 2, No. 1, 2011

Abstract: Rough set models based on the tolerance and similarity relations, have been widely used to deal with incomplete information systems. However, tolerance and similarity relations have their own limitations because the former is too loose while the latter is too strict in classification analysis. To make a reasonable and flexible classification in incomplete information system, a new binary relation is proposed in this paper. Such binary relation is only reflexive and it is a generalisation of tolerance and similarity relations. Furthermore, rough set models based on the above three different binary relations are compared. Finally, the direct approach to rules induction is investigated by using the proposed rough set, some illustrative examples are analysed to substantiate the conceptual arguments.

Online publication date: Sat, 28-Feb-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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:

Username:        Password:          Forgotten your 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