2007Journal of Anqing Teachers CollegeRequires access

An Algorithms for Attribute Reduction in Decision Table Based on Information Capacity in Rough Set

Yanping Zhang

Open publisher page 0 citations

Abstract

In this paper,an improved information quantity-based heuristic algorithm for reduction of attribute is proposed.Also,it presents a concept of conditional information capacity such as decision attribute set and relative condition attribute set,and uses the condition of knowledge information content to define the importance of the property.On this foundation,we put forward a kind of new algorithm based on information content where the complexity of it is O(|C|3|U|2,which can be shown that this algorithm is effective is effective and can be analyzed by practical example.

About this research paper

What this paper is about

In this paper,an improved information quantity-based heuristic algorithm for reduction of attribute is proposed.Also,it presents a concept of conditional information capacity such as decision attribute set and relative condition attribute set,and uses the condition of knowledge information content to define the importance of the property.On this foundation,we put forward a kind of new algorithm based on information content where the complexity of it is O(|C|3|U|2,which can be shown that this algorithm is effective is effective and can be analyzed by practical example.

Why it matters

A significance statement is not available in the OpenAlex record.

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 this paper,an improved information quantity-based heuristic algorithm for reduction of attribute is proposed.Also,it presents a concept of conditional information capacity such as decision attribute set and relative condition attribute set,and uses the condition of knowledge information content to define the importance of the property.On this foundation,we put forward a kind of new algorithm based on information content where the complexity of it is O(|C|3|U|2,which can be shown that this algorithm is effective is effective and can be analyzed by practical example.

Key concepts: Rough set, Decision table, Attribute domain, Reduction (mathematics), Data mining, Set (abstract data type), Dominance-based rough set approach, Heuristic

Related papers

Back to paper searchBrowse research topicsOriginal source
An Algorithms for Attribute Reduction in Decision Table Based on Information Capacity in Rough Set — Research Paper | ScholarLens