Refined β̂-QuickReduct: An Improved β̂-QuickReduct Algorithm with Verification of Original Results
Year: 2026
Type: article
Abstract: In this study, the heuristic β̂-QuickReduct algorithm in the variable precision rough set model for calculating a β̂-reduct candidate is refined. The Refined β̂-QuickReduct algorithm involves checking the redundancy of attributes in the β̂-reduct candidate obtained using the original β̂-QuickReduct and rejecting all redundant attributes. The advantage of this refinement is that the Refined β̂-QuickReduct always produces a valid β̂-reduct, a property that is theoretically guaranteed. Experimental results suggest that the Refined β̂-QuickReduct is significantly faster than the method of Nakahama et al. in calculating a valid β̂-reduct. Consequently, two issues are overcome in the calculation of a valid β̂-reduct: (i) the limitation of the original β̂-QuickReduct that renders the output β̂-reduct invalid because of the redundancy of attributes in the β̂-reduct candidate and (ii) the high computational cost in calculating a valid β̂-reduct by Nakahama et al.’s method.
Authors: Yasuo Kudo, Hajime Okawa
Language: English
Topic: Rough Sets and Fuzzy Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W7236742987
