Towards a Classification of Rough Set Bireducts

Size reduction mechanisms are very important in several mathematical fields. In rough set theory, bireducts arose to reduce simultaneously the set of attributes and the set of objects of the considered dataset, providing subsystems with the minimal sets of attributes that connect the maximum number of objects preserving the information of the original dataset. This paper presents the main properties of bireducts and how they can be used for removing inconsistencies. © 2020, Springer Nature Switzerland AG