DocumentCode
3432217
Title
Covering-based approximation operators by boolean matrix
Author
Li, Qingyin ; Zhu, William
Author_Institution
Lab of Granular Computing, Zhangzhou Normal University, 363000, China
fYear
2012
fDate
11-13 Aug. 2012
Firstpage
236
Lastpage
241
Abstract
Covering-based rough approximation space is an important generalization of classical rough approximation space. Matrix is not only a classical field in mathematics, but also a powerful tool in computer science. Recently, boolean matrices have been employed to define the sixth type of covering-based approximation operators. In this paper, we use matrices to describe the other five types of approximation operators. These descriptions can be obtained via two types of boolean product operations. The equivalent descriptions of the first type of approximation operators with indiscernible neighborhood are studied. The fourth covering-based upper approximation operator is described by predecessor neighborhood, which is generated from a relation induced by a covering. These equivalent descriptions about the fourth and the first type of approximation operators are used to obtain the representations of these three approximation operators by matrices. This work provides a more general approach for covering-based approximations through matrix.
Keywords
Approximation methods; Radio access networks; Radio frequency; Approximation operators; Boolean matrix; Covering; Indiscernible neighborhood;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing (GrC), 2012 IEEE International Conference on
Conference_Location
Hangzhou, China
Print_ISBN
978-1-4673-2310-9
Type
conf
DOI
10.1109/GrC.2012.6468665
Filename
6468665
Link To Document