2006•Unpublished venueRequires access

Principle of granularity of knowledge roughness and It’s attribute reduction

Lin Zhen-biao

Abstract

The classical rough set theory thinks knowledge is granular and defines the concept of knowledge roughness,but it can not completely distinguish the information from the different knowledge granularity.This paper,from the information theory,the concept of information granularity,granularity function and granularity entropy are defined.Granularity principle of knowledge roughness is studied stressfully.The paper offer a new heuristic attribute reduction algorithm based on conditional granularity entropy,though running an example,we show that this algorithm is effective.

About this research paper

What this paper is about

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

Key concepts: Granularity, Rough set, Granular computing, Entropy (arrow of time), Computer science, Mathematics, Data mining, Reduction (mathematics)