2008•Journal of Guangxi Normal UniversityRequires access

Attribute Reduction Based on Binary Granules and Granular Computing

Na Jiao

Abstract

At present,there are three theories about granular computing,Theory of Quotient Space,Theory of Computing with Words and Theory of Rough Set.Based on Granular Computing Theory of Rough Set,power graph,granularity-power graph and binary granules are defined.Two attribute reduction algorithms based on binary granular computing and granularity-power graph are put forward,which translate question of attribute reduction into problem of searching in granularity-power graph.These algorithms provide a new method in attribute reduction.Theoretical analysis shows that these algorithms of this paper are efficient and feasible.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 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: Granularity, Granular computing, Rough set, Binary number, Reduction (mathematics), Theoretical computer science, Computer science, Graph