DocumentCode
3310107
Title
Axiomatic characterizations of rough sets
Author
Xiaonan Li ; Huangjian Yi
Author_Institution
Dept. of Math., Xidian Univ., Xi´an, China
Volume
3
fYear
2011
fDate
26-28 July 2011
Firstpage
1437
Lastpage
1440
Abstract
The paper studies the axiomatization of rough sets. Pawlak matroids are characterized in terms of rank functions and connections between matchings in bipartites and Pawlak matroids are pointed out. Using topological approaches, the Pawlak upper approximation operator is characterized by one condition. Additionally, a possible generalization of Pawlak rough sets based on coverings is pointed out.
Keywords
approximation theory; combinatorial mathematics; rough set theory; topology; Pawlak matroids; Pawlak upper approximation; axiomatic characterizations; bipartites; generalization; rank functions; rough sets; topological approaches; Approximation methods; Bipartite graph; Computer science; Educational institutions; Rough sets; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Systems and Knowledge Discovery (FSKD), 2011 Eighth International Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-61284-180-9
Type
conf
DOI
10.1109/FSKD.2011.6019831
Filename
6019831
Link To Document