2007•Computer Engineering and Applications JournalRequires access

Algorithm for decision rules reduction based on binary discernibility matrix

Xihuai Wang, Tengfei Zhang, Jianmei Xiao

Open publisher page 9 citations

Abstract

The decision rules reduction,namely deleting the redundant attribute values of each rule in decision table,is an important topic in the research on data reduction based on rough set theory.It can be achieved by heuristic information after attribute reduction.A method for calculating decision rules core based on binary discernibility matrix is presented directly.And then,an algorithm for decision rules reduction is designed,which is suitable for not only consistent decision table but also inconsistent decision table.

About this research paper

What this paper is about

The decision rules reduction,namely deleting the redundant attribute values of each rule in decision table,is an important topic in the research on data reduction based on rough set theory.It can be achieved by heuristic information after attribute reduction.A method for calculating decision rules core based on binary discernibility matrix is presented directly.And then,an algorithm for decision rules reduction is designed,which is suitable for not only consistent decision table but also inconsistent decision table.

Why it matters

OpenAlex reports 9 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 decision rules reduction,namely deleting the redundant attribute values of each rule in decision table,is an important topic in the research on data reduction based on rough set theory.It can be achieved by heuristic information after attribute reduction.A method for calculating decision rules core based on binary discernibility matrix is presented directly.And then,an algorithm for decision rules reduction is designed,which is suitable for not only consistent decision table but also inconsistent decision table.

Key concepts: Decision table, Rough set, Reduction (mathematics), Decision rule, Decision matrix, Matrix (chemical analysis), Dominance-based rough set approach, Heuristic

Related papers

Back to paper searchBrowse research topicsOriginal source
Algorithm for decision rules reduction based on binary discernibility matrix — Research Paper | ScholarLens