Applications of repeat degree on coverings of neighborhoods
In covering based rough sets, the neighborhood of an element is the intersection of all the covering blocks containing the element. All the neighborhoods form a new covering called a covering of neighborhoods. In the course of studying under what condition a covering of neighborhoods is a partition, the concept of repeat degree is proposed, with the help of which the issue is addressed. This paper studies further the application of repeat degree on coverings of neighborhoods. First, we investigate under what condition a covering of neighborhoods is the reduct of the covering inducing it. As a preparation for addressing this issue, we give a necessary and sufficient condition for a subset of a set family to be the reduct of the set family. Then we study under what condition two coverings induce a same relation and a same covering of neighborhoods. Finally, we give the method of calculating the covering according to repeat degree.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Foundational propositions of hesitant fuzzy soft $β$-covering approximation spaces
Soft set theory serves as a mathematical framework for handling uncertain information, and hesitant fuzzy sets find extensive application in scenarios involving uncertainty and hesitation. Hesitant fuzzy sets exhibit div…
Interval-valued fuzzy soft $β$-covering approximation spaces
The concept of interval-valued fuzzy soft $\beta$-covering approximation spaces (IFS$\beta$CASs) is introduced to combine the theories of soft sets, rough sets and interval-valued fuzzy sets, and some fundamental proposi…
Boosting Few-Pixel Robustness Verification via Covering Verification Designs
Proving local robustness is crucial to increase the reliability of neural networks. While many verifiers prove robustness in $L_\infty$ $\epsilon$-balls, very little work deals with robustness verification in $L_0$ $\eps…
Rough matroids based on coverings
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the al…
Combinatorial OptimizationRunaway Feedback Loops in Predictive Policing
Predictive policing systems are increasingly used to determine how to allocate police across a city in order to best prevent crime. Discovered crime data (e.g., arrest counts) are used to help update the model, and the p…