An Algorithm of Attribute Reduction Based on Discernibility Matrix
Yinhua Li
Abstract
Yinhua Li
Abstract
Knowledge reduction is a very important topic in the rough set theory. An improving algorithm ARDM of the conventional method for constructing the discernibility matrix of an information system or a decision table is presented by using the role of absorptive law which reacts on simplifying process into the process of constructing the discernibility matrix. This algorithm reduces the scan times of elements in the discemibility matrix and computation.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Knowledge reduction is a very important topic in the rough set theory. An improving algorithm ARDM of the conventional method for constructing the discernibility matrix of an information system or a decision table is presented by using the role of absorptive law which reacts on simplifying process into the process of constructing the discernibility matrix. This algorithm reduces the scan times of elements in the discemibility matrix and computation.
Key concepts: Rough set, Reduction (mathematics), Matrix (chemical analysis), Decision table, Algorithm, Computation, Set (abstract data type), Computer science