2008Computer Engineering and ScienceRequires access

A Heuristic Algorithm for Attribute Reduction Based on the Discernibility Matrix

Qibing Zhu

Open publisher page 2 citations

Abstract

In order to obtain good relative attribute reduction in decision systems, a heuristic algorithm for attribute reduction based on discernibility matrix is proposed. The algorithm is based on the discernibility matrix, not only the mutual information between selected conditional attributes and decision attributes are considered, but also its value distribution. A new attribute importance measurement method is defined from the viewpoint of information theory, and the measurement is used as the heuristic information. Finally an attribute reduction set is obtained. The experimental results show that the algorithm can effectively reduce the decision system and obtain ideal reduction results, and that the number of decision rules after the reduction is small.

About this research paper

What this paper is about

In order to obtain good relative attribute reduction in decision systems, a heuristic algorithm for attribute reduction based on discernibility matrix is proposed. The algorithm is based on the discernibility matrix, not only the mutual information between selected conditional attributes and decision attributes are considered, but also its value distribution. A new attribute importance measurement method is defined from the viewpoint of information theory, and the measurement is used as the heuristic information. Finally an attribute reduction set is obtained. The experimental results show that the algorithm can effectively reduce the decision system and obtain ideal reduction results, and that the number of decision rules after the reduction is small.

Why it matters

OpenAlex reports 2 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

In order to obtain good relative attribute reduction in decision systems, a heuristic algorithm for attribute reduction based on discernibility matrix is proposed. The algorithm is based on the discernibility matrix, not only the mutual information between selected conditional attributes and decision attributes are considered, but also its value distribution. A new attribute importance measurement method is defined from the viewpoint of information theory, and the measurement is used as the heuristic information. Finally an attribute reduction set is obtained. The experimental results show that the algorithm can effectively reduce the decision system and obtain ideal reduction results, and that the number of decision rules after the reduction is small.

Key concepts: Rough set, Reduction (mathematics), Computer science, Heuristic, Algorithm, Matrix (chemical analysis), Decision table, Attribute domain

Related papers

Back to paper searchBrowse research topicsOriginal source
A Heuristic Algorithm for Attribute Reduction Based on the Discernibility Matrix — Research Paper | ScholarLens