Name
Abstract | ||
|---|---|---|
Rough sets are mainly defined by means of neighborhood systems. In this paper, a type of novel definition of the approximation operators is proposed via a predefined boundary region based on a binary relation. Then, the comparison between the new definitions and the original ones is made. The necessary and sufficient conditions of their equipollence are obtained. This paper also gives the definitions of boundaries based on covering. By employing the boundaries, a type of novel definition of the approximation operators based on covering is proposed. It is shown that the novel operators are equivalent to a type of covering approximation operators. Finally, with the aid of the boundary region, the relation between the general binary relations and the covering-based approximation operators is examined. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ICMLC.2015.7340920 | 2015 International Conference on Machine Learning and Cybernetics (ICMLC) |
Keywords | Field | DocType |
Boundary region,Binary relation,Covering,Approximation operators | Discrete mathematics,Approximation operators,Covering relation,Pattern recognition,Algebra,Binary relation,Computer science,Equipollence,Rough set,Artificial intelligence,Operator (computer programming) | Conference |
Volume | ISSN | Citations |
1 | 2160-133X | 0 |
PageRank | References | Authors |
0.34 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhou-Ming Ma | 1 | 2 | 0.69 |
| Ju-Sheng Mi | 2 | 2054 | 77.81 |