Improved rough approximations based on variable J-containment neighborhoods

Classic generalized rough set model in neighborhood systems provides a more general framework for depicting approximations, while it may meet the non-reflexive situations. Some scholars put forward different neighborhoods, such as adhesion neighborhoods (briefly, [Formula: see text] -neighborhoods), containment neighborhoods (briefly, [Formula: see text] -neighborhoods), and [Formula: see text] -neighborhoods. However, not all of them are reflexive. Moreover, the granularity of [Formula: see text] -neighborhoods and [Formula: see text] -neighborhoods are too fine, and that of [Formula: see text] -neighborhoods too coarse. To solve the problem, we aim to design a novel construction approach of neighborhoods, called variable j-containment neighborhoods (briefly, [Formula: see text] -neighborhoods), which satisfies the reflexivity and the granularity so flexible that the neighborhood space can adjust the granularity to meet the needs of problems. We generalize three kinds of rough approximations in [Formula: see text] -neighborhood spaces and discuss their properties. What’s more, we analyze the topology structures relying on [Formula: see text] -neighborhood spaces and compare our proposed approach with the existing approaches. By selecting the appropriate parameter [Formula: see text] , our neighborhood system is more flexible in adjusting the granularity to fit problem requirements. And illustrative examples demonstrate the advantages of the proposed rough set model to attribute reduction in incomplete information systems.