2005•Microcomputer DevelopmentRequires access

A Complete Algorithm for Attribute Reduction Based on Dicernibility Matrix

Xiaowei Li

Abstract

To get a better set of attribute reduction,this paper proposed a new algorithm for attribute reduction based on the study of dicernibility matrix of rough sets.This algorithm focuses on the computing of the attribute set gotten from the dicernibility matrix,in order to get a new set.Based on the analysis of this new set,a complete algorithm for attribute reduction is given.Finally analyzed the time complexity of this algorithm and gave the proof of its completeness.

About this research paper

What this paper is about

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

Key concepts: Computer science, Reduction (mathematics), Rough set, Attribute domain, Algorithm, Set (abstract data type), Completeness (order theory), Matrix (chemical analysis)