Attribute reduction; Binary discernibility matrix; Reduct; Rough sets Algorithms; Bins; Computation theory; Matrix algebra; Attribute reduction; Attribute reduction algorithm; Basic concepts; Binary discernibility matrix; Binary representations; Discernibility matrix; Information table; Reduct; Rough set theory
Attribute reduction is a very important task in Rough Set Theory. In this context, in recent years several attribute reduction algorithms based on the discernibility matrix have been proposed. In this paper, we go back to the binary discernibility matrix and reformulate some basic concepts that allow us to build on them an algorithm for computing reducts. The proposed algorithm takes advantage of the binary representation used for the discernibility matrix and depending on the fulfillment of certain pruning properties several candidates can be jumped (pruned). In this way, the number of candidates to be tested is reduced. Additionally, from the binary discernibility matrix, we define a more compact and ordered matrix, which allows reducing even more the amount of candidates to be evaluated, and the cost of verifying each one of them. The proposed algorithm is able to compute all the reducts of an information table, but it can also be used to find a reduct, or a certain number of them. Experiments over standard datasets show that our algorithm has a good performance. © 2016 - IOS Press and the authors. All rights reserved.
A new algorithm for computing reducts based on the binary discernibility matrix
Document
Generically Dependent Continuant
RDF description of A new algorithm for computing reducts based on the binary discernibility matrix - http://orbis.uaslp.mx/vivo/individual/scopus4479
Article
Information Content Entity