scholar.google.com › citations
In this paper, reduct and core computation for incompatible information systems is studied based on the algebraic view. A new method to construct discernibility ...
A new method to construct discernibility matrix is proposed, which is a generalization of the methods presented by Hu(1995), Ye(2002) and Qing(2003), ...
In this paper, reduct and core computation for incompatible information systems is studied based on the algebraic view. A new method to construct discernibility ...
Reduct and core computation is one of the key problems in rough set theory due to its applications in data mining extensively. Much attention presently has ...
Feb 15, 2021 · Over the years, rough set theory has emerged as a robust mathematical framework for attribute reduction (also known as reduct computation).
Missing: Incompatible | Show results with:Incompatible
A set-theoretical approach to finding reducts of composed information systems is presented. It is shown how the search space can be represented in form of a ...
Missing: Reduct Incompatible
Oct 22, 2024 · Reduct and core computation is one of the key problems in rough set theory due to its applications in data mining extensively. Much attention ...
Jul 20, 2020 · Two frameworks are proposed by considering the relationships between attributes, which aim to accelerate the process of searching reducts.
Apr 12, 2024 · In this study, the role of core attributes is analyzed in terms of their impacts on classification ability, and the three-way partition of ...
In this paper, theories and approaches of distribution reduction are investigated in inconsistent ordered information systems. Furthermore, algorithm of matrix ...
Missing: Incompatible | Show results with:Incompatible