2011Jisuanji gongchengRequires access

Complete Attribute Reduction Algorithm Based on Discernibility Matrix

Wenhao Shu

Open publisher page 0 citations

Abstract

The method of attribute reduction algorithm based on discernibility matrix needs to compute the discernibility matrix of the decision table.However,computing the discernibility matrix not only spends much time but also needs a large of memory space.In order to get over the defect and use the idea of discernibility matrix methods,this paper presents a new improved attribute reduction algorithm based on the number of all not null objects.At the same time,the definition of the attributes importance is presented and a quickly computed formula is provided.The formula only needs to compute and to compute the attributes importance.Example analysis shows that the time is reduced,and it illustrates the minimum attribute reduction of the new algorithm.

About this research paper

What this paper is about

The method of attribute reduction algorithm based on discernibility matrix needs to compute the discernibility matrix of the decision table.However,computing the discernibility matrix not only spends much time but also needs a large of memory space.In order to get over the defect and use the idea of discernibility matrix methods,this paper presents a new improved attribute reduction algorithm based on the number of all not null objects.At the same time,the definition of the attributes importance is presented and a quickly computed formula is provided.The formula only needs to compute and to compute the attributes importance.Example analysis shows that the time is reduced,and it illustrates the minimum attribute reduction of the new algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The method of attribute reduction algorithm based on discernibility matrix needs to compute the discernibility matrix of the decision table.However,computing the discernibility matrix not only spends much time but also needs a large of memory space.In order to get over the defect and use the idea of discernibility matrix methods,this paper presents a new improved attribute reduction algorithm based on the number of all not null objects.At the same time,the definition of the attributes importance is presented and a quickly computed formula is provided.The formula only needs to compute and to compute the attributes importance.Example analysis shows that the time is reduced,and it illustrates the minimum attribute reduction of the new algorithm.

Key concepts: Reduction (mathematics), Rough set, Decision table, Computer science, Matrix (chemical analysis), Algorithm, Null (SQL), Table (database)

Related papers

Back to paper searchBrowse research topicsOriginal source
Complete Attribute Reduction Algorithm Based on Discernibility Matrix — Research Paper | ScholarLens