.png){kind=icon}
.png){kind=icon}
Return
RCC-MAS: a new algorithm for computing all rough-set-constructs
.png){kind=icon}
PRE
AI
DOI：10.1007/s10994-025-06786-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In rough set theory, a construct is defined as a subset of attributes possessing the same capacity as the complete set of attributes to discern objects from different classes, while preserving similarity between objects from the same class. In the literature, it has been shown that algorithms designed for computing reducts or typical testors can be modified to calculate constructs. However, in practice, there are scenarios where even the fastest algorithms in the current state-of-the-art struggle to compute all constructs within a reasonable time-frame. This paper presents a novel algorithm to compute all constructs within a decision table to reduce this gap. Our proposed algorithm, RCC-MAS, works on the binary discernibility-similarity matrix and employs a recursive approach to reduce the search space systematically by analyzing minimum attribute subsets whose attributes, when excluded, lead to rows with zeros in those attributes in the matrix, violating the construct definition. This strategy reduces the number of subsets generated, focusing on attributes essential for constructs; additionally, we demonstrate theoretically that all constructs are computed. Experimental evaluations spanning several synthetic and real-world decision tables reveal that RCC-MAS is the best option to compute constructs regardless of the density of the SBDSM.
Keywords:
Rough sets
Constructs
Minimum attribute subsets
Pairwise comparison matrix
Journal
IF:
2.9
Papers:
2.6K
Citations:
3.4W