[1]CHE Xiaoya,LI Leijun,MI Jusheng.Evidence-theory-based numerical characterization of multi-granulation covering rough sets[J].CAAI Transactions on Intelligent Systems,2016,11(4):481-486.[doi:10.11992/tis.201606011]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
11
Number of periods:
2016 4
Page number:
481-486
Column:
学术论文—知识工程
Public date:
2016-07-25
- Title:
-
Evidence-theory-based numerical characterization of multi-granulation covering rough sets
- Author(s):
-
CHE Xiaoya1; LI Leijun1; 2; MI Jusheng1; 2
-
1. College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050024, China;
2. Hebei Key Laboratory of Computational Mathematics and Applications, Shijiazhuang 050024, China
-
- Keywords:
-
rough sets theory; covering; granulation; evidence theory; approximation; characterization
- CLC:
-
TP18
- DOI:
-
10.11992/tis.201606011
- Abstract:
-
Considering classical multi-granulation rough sets and using the maximal and minimal descriptors of objects in a given universe, this paper proposes four pessimistic multi-granulation covering rough set models, suitable for extensive application. Based on set union and portion functions, the notion of multi-granularity covering connected to a number of coverings and a single granularity partition in the domain are defined. On this basis, belief and plausibility functions from evidence theory are employed to define the relationship between the upper and lower approximations, the belief function, and the likelihood function, and to characterize the set approximations in the four models. Compared with classical multi-granulation rough sets, the pessimistic multi-granulation covering rough set models not only have distinct advantages and combine multi-source information, but also avoid the shortcomings of a narrow application range. Finally, a real example is used to demonstrate the effectiveness of the presented models.