2008Journal of Chinese Computer SystemsRequires access

Presentation of Relative Partition Granularity of Attributes Reduction for Decision Table

Cheng Yi

Open publisher page 3 citations

Abstract

Knowledge and classifications are related together by the theory of rough sets which claim is that knowledge is deep-seated in the classificatory abilities of human beings. In this paper, we firstly give a quantitative representation of the ability of knowledge's classification, and provide a novel representation for knowledge, that is, it can be expressed by partition granularity. Secondly, the relative partition granularity is defined, and its qualities are discussed, where the relative partition granularity can be used to descript the classification ability of conditional attributes relate to decision attribute. Finally, the equivalence between the algebraic representation and the relative partition granularity representation is proved for a consistent decision table.

About this research paper

What this paper is about

Knowledge and classifications are related together by the theory of rough sets which claim is that knowledge is deep-seated in the classificatory abilities of human beings. In this paper, we firstly give a quantitative representation of the ability of knowledge's classification, and provide a novel representation for knowledge, that is, it can be expressed by partition granularity. Secondly, the relative partition granularity is defined, and its qualities are discussed, where the relative partition granularity can be used to descript the classification ability of conditional attributes relate to decision attribute. Finally, the equivalence between the algebraic representation and the relative partition granularity representation is proved for a consistent decision table.

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

Knowledge and classifications are related together by the theory of rough sets which claim is that knowledge is deep-seated in the classificatory abilities of human beings. In this paper, we firstly give a quantitative representation of the ability of knowledge's classification, and provide a novel representation for knowledge, that is, it can be expressed by partition granularity. Secondly, the relative partition granularity is defined, and its qualities are discussed, where the relative partition granularity can be used to descript the classification ability of conditional attributes relate to decision attribute. Finally, the equivalence between the algebraic representation and the relative partition granularity representation is proved for a consistent decision table.

Key concepts: Granularity, Partition (number theory), Computer science, Rough set, Decision table, Equivalence (formal languages), Representation (politics), Data mining

Related papers

Back to paper searchBrowse research topicsOriginal source
Presentation of Relative Partition Granularity of Attributes Reduction for Decision Table — Research Paper | ScholarLens