Lattice structures of fixed points of the lower approximations of two types of covering-based rough sets
Qingyin Li, William Zhu

TL;DR
This paper investigates the lattice structures formed by fixed points of lower approximations in covering-based rough sets, revealing conditions under which these sets form various algebraic structures like Boolean lattices and double Stone algebras.
Contribution
It introduces two families of fixed point sets related to covering-based rough sets and characterizes their lattice and algebraic structures under different conditions.
Findings
Fixed point set of neighborhoods forms a complete, distributive lattice and a double p-algebra.
When neighborhoods form a partition, it becomes a boolean lattice and a double Stone algebra.
Fixed point set of covering forms a complete lattice; becomes distributive and a double p-algebra when covering is unary.
Abstract
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough sets. In this paper, we propose two family of sets and study the conditions that these two sets become some lattice structures. These two sets are consisted by the fixed point of the lower approximations of the first type and the sixth type of covering-based rough sets, respectively. These two sets are called the fixed point set of neighborhoods and the fixed point set of covering, respectively. First, for any covering, the fixed point set of neighborhoods is a complete and distributive lattice, at the same time, it is also a double p-algebra. Especially, when the neighborhood forms a partition of the universe, the fixed point set of neighborhoods is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Advanced Numerical Analysis Techniques
