ScholarLens Back to search
2008•Computer Engineering and Applications JournalRequires access

Algorithm for attribute reduction based on improved binary discernibility matrix

Xiaoguo Zhang

Open publisher page 0 citations

Abstract

Attributes reduction is one of important parts researched in rough set theory,thus,many algorithms have been proposed for attributes reduction,unfortunately,these algorithms based on discernibility matrix mainly aim at the consistent decision table,and can not get a correct result for an inconsistent decision table in some cases,therefore,in this paper,an algorithm for attribute reduction based on improved binary discernibility matrix,this algorithm is suitable for any decision tables.Finally,some examples are shown that the minimal reduction of similar information systems can be obtained by using the algorithm.

About this research paper

What this paper is about

Attributes reduction is one of important parts researched in rough set theory,thus,many algorithms have been proposed for attributes reduction,unfortunately,these algorithms based on discernibility matrix mainly aim at the consistent decision table,and can not get a correct result for an inconsistent decision table in some cases,therefore,in this paper,an algorithm for attribute reduction based on improved binary discernibility matrix,this algorithm is suitable for any decision tables.Finally,some examples are shown that the minimal reduction of similar information systems can be obtained by using the 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

Attributes reduction is one of important parts researched in rough set theory,thus,many algorithms have been proposed for attributes reduction,unfortunately,these algorithms based on discernibility matrix mainly aim at the consistent decision table,and can not get a correct result for an inconsistent decision table in some cases,therefore,in this paper,an algorithm for attribute reduction based on improved binary discernibility matrix,this algorithm is suitable for any decision tables.Finally,some examples are shown that the minimal reduction of similar information systems can be obtained by using the algorithm.

Key concepts: Rough set, Decision table, Reduction (mathematics), Matrix (chemical analysis), Binary number, Algorithm, Set (abstract data type), Mathematics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Algorithm for attribute reduction based on improved binary discernibility matrix — Research Paper | ScholarLens