2013Unpublished venueRequires access

Attribute Reduction Alogrithm Based on Information Entropy and Its Application

Dong Yang

Open publisher page 0 citations

Abstract

Attribute reduction is one of the important issues of rough set.It can remove superfluous knowledge from decision system which the ability of classification is preserved,and improve efficiency of decision system.This paper expounds the basic conceptions of rough set theory and information entropy,and an algorithm of attribute reduction based on rough set and information entropy is put forward.The algorithm from the point of view of relative core,make information entropy and conditional entropy and the important degree of attributes together to use.This algorithm optimizes the structure of the original algorithm and speeds up the speed of attribute reduction.The proposed algorithm is validated by experiment through using CTR and Wine data set.The experimental results show that the algorithm can obtain the optimal attribute reduction of decision system,and speed up the speed.

About this research paper

What this paper is about

Attribute reduction is one of the important issues of rough set.It can remove superfluous knowledge from decision system which the ability of classification is preserved,and improve efficiency of decision system.This paper expounds the basic conceptions of rough set theory and information entropy,and an algorithm of attribute reduction based on rough set and information entropy is put forward.The algorithm from the point of view of relative core,make information entropy and conditional entropy and the important degree of attributes together to use.This algorithm optimizes the structure of the original algorithm and speeds up the speed of attribute reduction.The proposed algorithm is validated by experiment through using CTR and Wine data set.The experimental results show that the algorithm can obtain the optimal attribute reduction of decision system,and speed up the speed.

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

Attribute reduction is one of the important issues of rough set.It can remove superfluous knowledge from decision system which the ability of classification is preserved,and improve efficiency of decision system.This paper expounds the basic conceptions of rough set theory and information entropy,and an algorithm of attribute reduction based on rough set and information entropy is put forward.The algorithm from the point of view of relative core,make information entropy and conditional entropy and the important degree of attributes together to use.This algorithm optimizes the structure of the original algorithm and speeds up the speed of attribute reduction.The proposed algorithm is validated by experiment through using CTR and Wine data set.The experimental results show that the algorithm can obtain the optimal attribute reduction of decision system,and speed up the speed.

Key concepts: Rough set, Conditional entropy, Entropy (arrow of time), Data mining, Attribute domain, Algorithm, Mathematics, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Attribute Reduction Alogrithm Based on Information Entropy and Its Application — Research Paper | ScholarLens