Refined β̂-QuickReduct: An Improved β̂-QuickReduct Algorithm with Verification of Original Results

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

Institutions

Publication Details

Journal
Journal of Advanced Computational Intelligence and Intelligent Informatics
Published
2026-11-20
DOI
https://doi.org/10.20965/jaciii.2026.p2053
Primary Topic
Rough Sets and Fuzzy Logic
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Refined β̂-QuickReduct: An Improved β̂-QuickReduct Algorithm with Verification of Original Results

Yasuo Kudo, Hajime Okawa
Journal of Advanced Computational Intelligence and Intelligent Informatics
Rough Sets and Fuzzy Logic
article

Refined β̂-QuickReduct: An Improved β̂-QuickReduct Algorithm with Verification of Original Results

Yasuo Kudo, Hajime Okawa
article en

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.

Journal of Advanced Computational Intelligence and Intelligent InformaticsVol. 30(6)
Muroran Institute of Technology (JP), National Institute of Technology, Tomakomai College (JP)
Rough Sets and Fuzzy Logic
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon