Three-Way Approximations with Covering-Based Rough Set

In order to approximate an undefinable set of objects by using the extensions in OE-concept lattices, this study combines three-way concept analysis with covering-based rough set and introduces an innovative approach for managing uncertain information and decision-making. This approach employs the minimal neighborhood of the maximal description, which is determined by meet-irreducible elements, to define the lower and upper of an undefinable set. On this basis, we formalize the concepts of lower and upper approximation OE-concepts and propose a three-way approximation optimization algorithm. Experimental results demonstrate the effectiveness and efficiency of our algorithm.