Further Considerations of Classification-Oriented and Approximation-Oriented Rough Sets in Generalized Settings

Masahiro Inuiguchi
Additional contact information
Masahiro Inuiguchi: Osaka University, Japan

International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), 2010, vol. 4, issue 2, 12-34

Abstract: Rough sets can be interpreted in two ways: classification of objects and approximation of a set. From this point of view, classification-oriented and approximation-oriented rough sets have been proposed. In this paper, the author reconsiders those two kinds of rough sets with reviewing their definitions, properties and relations. The author describes that rough sets based on positive and negative extensive relations are mathematically equivalent but it is important to consider both because they obtained positive and negative extensive relations are not always in inverse relation in the real world. The difference in size of granules between union-based and intersection-based approximations is emphasized. Moreover, the types of decision rules associated with those rough sets are shown.

Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/jcini.2010040102 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jcini0:v:4:y:2010:i:2:p:12-34

Access Statistics for this article

International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) is currently edited by Kangshun Li

More articles in International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) from IGI Global
Bibliographic data for series maintained by Journal Editor ().