Applications of repeat degree to coverings of neighborhoods

作者：Yao, Hua; Zhu, William^*

来源：International Journal of Machine Learning and Cybernetics, 2016, 7(6): 931-941.

DOI：10.1007/s13042-014-0287-4

• Granular computing
• Repeat degree
• Neighborhood
• Covering of neighborhoods
• Reduct

Covering of neighborhoods is an important concept in covering-based rough sets. There are many unsolved issues related to coverings of neighborhoods. The concept of repeat degree is proposed to study under what condition a covering of neighborhoods is a partition. It enables us to deal with many issues related to coverings of neighborhoods when coverings are incomplete. This paper applies repeat degree to solve some fundamental issues in coverings of neighborhoods. First, we investigate under what condition a covering of neighborhoods is equal to the reduct of the covering which induces the covering of neighborhoods. Then we study under what condition two coverings induce the same relation and the same covering of neighborhoods. Finally, we propose an approach to calculate coverings through repeat degree.

• 出版日期2016-12
• 单位闽南师范大学