DocumentCode
2925587
Title
Rough matroid
Author
Zhu, William ; Wang, Shiping
Author_Institution
Lab. of Granular Comput., Zhangzhou Normal Univ., Zhangzhou, China
fYear
2011
fDate
8-10 Nov. 2011
Firstpage
817
Lastpage
824
Abstract
This paper proposes a framework to integrate rough sets with matroids. Specifically, we propose the lower and upper rough matroids which extend the matroid. They are established by the lower and upper approximations of generalized rough sets based on relations, respectively. As a generalization of the lower (upper) rough matroid, the lower (upper) rough greedoid is defined, and it also a generalization of the greedoid. Moreover, an axiom of poset matroid is provided by generalized rough sets based on relations. Finally, we prove that the poset matroid is a special case of the lower rough greedoid.
Keywords
combinatorial mathematics; matrix algebra; rough set theory; poset matroid; rough greedoid; rough matroid; rough set; Approximation methods; Bayesian methods; Educational institutions; Fuzzy sets; Probabilistic logic; Rough sets; Poset matroid; Rough greedoid; Rough matroid;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing (GrC), 2011 IEEE International Conference on
Conference_Location
Kaohsiung
Print_ISBN
978-1-4577-0372-0
Type
conf
DOI
10.1109/GRC.2011.6122704
Filename
6122704
Link To Document