2011Computer Engineering and Applications JournalRequires access

Improved tolerance matrix attribute reduction algorithm

Yang Bing-ru

Open publisher page 0 citations

Abstract

In rough set theory,knowledge reduction has been one of the key contents.In this paper a new tolerance matrix is defined relative to tolerance relation-based attribute reduction algorithm under incomplete information systems in related reference.It is able to reduce the number of conditional attributes which need to be concerned.At the same time,it is proved that the attribute reduction acquired from this new method is equivalent to the attribute reduction in related reference. An algorithm for attribute reduction is presented,the speed of attribute reduction in incomplete information systems is increased.

About this research paper

What this paper is about

In rough set theory,knowledge reduction has been one of the key contents.In this paper a new tolerance matrix is defined relative to tolerance relation-based attribute reduction algorithm under incomplete information systems in related reference.It is able to reduce the number of conditional attributes which need to be concerned.At the same time,it is proved that the attribute reduction acquired from this new method is equivalent to the attribute reduction in related reference. An algorithm for attribute reduction is presented,the speed of attribute reduction in incomplete information systems is increased.

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

In rough set theory,knowledge reduction has been one of the key contents.In this paper a new tolerance matrix is defined relative to tolerance relation-based attribute reduction algorithm under incomplete information systems in related reference.It is able to reduce the number of conditional attributes which need to be concerned.At the same time,it is proved that the attribute reduction acquired from this new method is equivalent to the attribute reduction in related reference. An algorithm for attribute reduction is presented,the speed of attribute reduction in incomplete information systems is increased.

Key concepts: Reduction (mathematics), Rough set, Attribute domain, Key (lock), Matrix (chemical analysis), Computer science, Data mining, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Improved tolerance matrix attribute reduction algorithm — Research Paper | ScholarLens