Covering based approximation – a new type approach
by Debadutta Mohanty
International Journal of Computational Vision and Robotics (IJCVR), Vol. 1, No. 3, 2010

Abstract: The rough set theory, proposed by Pawlak is termed as basic (traditional) rough set theory and it has been extended in many directions. Covering based rough set is one of the extensions of the basic rough set theory. A covering is a generalisation of notion of partitioned rough set (Pawalk rough set) introduced by W. Zakowski. In this article it is introduced a new type of covering-based rough set in which both lower and upper approximation operators are improved.

Online publication date: Sat, 15-Jan-2011

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 Computational Vision and Robotics (IJCVR):
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