Numerical Characterizations of Topological Reductions of Covering Information Systems in Evidence Theory

Yan-Lan Zhang and Chang-Qing Li

Mathematical Problems in Engineering, 2021, vol. 2021, 1-9

Abstract:

The reductions of covering information systems in terms of covering approximation operators are one of the most important applications of covering rough set theory. Based on the connections between the theory of topology and the covering rough set theory, two kinds of topological reductions of covering information systems are discussed in this paper, which are characterized by the belief and plausibility functions from the evidence theory. The topological spaces by two pairs of covering approximation operators in covering information systems are pseudo-discrete, which deduce partitions. Then, using plausibility function values of the sets in the partitions, the definitions of significance and relative significance of coverings are presented. Hence, topological reduction algorithms based on the evidence theory are proposed in covering information systems, and an example is adopted to illustrate the validity of the algorithms.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/6648108.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/6648108.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:6648108

DOI: 10.1155/2021/6648108

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().