A new algorithm for computing reducts based on the binary discernibility matrix
page end: 337
estado: published
type: Document
type: Information Content Entity
most specific type: Document
freetext keyword: 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
related by: authorship_26252
date time value: article date 4480
most specific type: Article
type: Article
crisid: 4480
related by: authorship_26255
volume: 20
related by: authorship_26254
type: Thing
issue: 2
origen: scopus
abstract: 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.
type: Generically Dependent Continuant
e iscopus: 2-s2.0-84960964411
has publication venue: Intelligent Data Analysis
related by: authorship_26253
doi: 10.3233/IDA-160807
type: Entity
page start: 317
type: Continuant

Document
type: Class

Continuant
type: Class

Entity
type: Class

Generically Dependent Continuant
type: Class

RDF description of A new algorithm for computing reducts based on the binary discernibility matrix - http://orbis.uaslp.mx/vivo/individual/scopus4479
rights: termsOfUse
date: 2026-08-27T19:38:30
publisher: vivo
type: Document

Article
type: Class

Intelligent Data Analysis
type: Thing
type: Information Content Entity
type: Continuant
type: Generically Dependent Continuant
type: Collection
type: Journal
publication venue for: A new algorithm for computing reducts based on the binary discernibility matrix
type: Document
type: Periodical
type: Entity

Information Content Entity
type: Class