ScholarLens Back to search
2006•Jisuanji gongcheng yu shejiRequires access

Research of algorithm for attribute value reduction based on rough set

Li Ming

Open publisher page 1 citations

Abstract

The nature and the process of attribute value reduction from the view of logic are analysed and based on this a discernibility matrix is constructed.Then this paper proposes a new algorithm for attribute value reduction based on rough set is proposed and the correct and feasibility of it are proved.The new algorithm is easy to be realized by programming.Not only it can get more concise decision rules,but also it doesn't break the information of inconsistent decision rules.The analysis of the realistic example shows that the algorithm is effective and feasible.

About this research paper

What this paper is about

The nature and the process of attribute value reduction from the view of logic are analysed and based on this a discernibility matrix is constructed.Then this paper proposes a new algorithm for attribute value reduction based on rough set is proposed and the correct and feasibility of it are proved.The new algorithm is easy to be realized by programming.Not only it can get more concise decision rules,but also it doesn't break the information of inconsistent decision rules.The analysis of the realistic example shows that the algorithm is effective and feasible.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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 nature and the process of attribute value reduction from the view of logic are analysed and based on this a discernibility matrix is constructed.Then this paper proposes a new algorithm for attribute value reduction based on rough set is proposed and the correct and feasibility of it are proved.The new algorithm is easy to be realized by programming.Not only it can get more concise decision rules,but also it doesn't break the information of inconsistent decision rules.The analysis of the realistic example shows that the algorithm is effective and feasible.

Key concepts: Rough set, Computer science, Reduction (mathematics), Attribute domain, Algorithm, Value (mathematics), Set (abstract data type), Decision table

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Research of algorithm for attribute value reduction based on rough set — Research Paper | ScholarLens