2010•Jisuanji gongcheng yu shejiRequires access

Attribute reduction algorithm for rough set based on improving genetic algorithm

Fu Ming

Open publisher page 0 citations

Abstract

An attribute reduction is the main content which the rough set theory studies,and the goal is to achieve the minimal reduciton of the attributes efficitively in a decision table.Based on analysis of attribute reduction and genetic algorithm and regarding the significance of attributes as heuristic information,the heuristic information is introduced into genetic algorithm,and an effective heurisitic genetic algorithm is proposed.A new mutate operator is used for introducing the heurisitic information and the operator is a local research method using heurisitic information.So the algorithm converges quickly and has global optimizing ability.The results show that the method can calculate minimal reduction of decision charts quickly and effectively.

About this research paper

What this paper is about

An attribute reduction is the main content which the rough set theory studies,and the goal is to achieve the minimal reduciton of the attributes efficitively in a decision table.Based on analysis of attribute reduction and genetic algorithm and regarding the significance of attributes as heuristic information,the heuristic information is introduced into genetic algorithm,and an effective heurisitic genetic algorithm is proposed.A new mutate operator is used for introducing the heurisitic information and the operator is a local research method using heurisitic information.So the algorithm converges quickly and has global optimizing ability.The results show that the method can calculate minimal reduction of decision charts quickly and effectively.

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

An attribute reduction is the main content which the rough set theory studies,and the goal is to achieve the minimal reduciton of the attributes efficitively in a decision table.Based on analysis of attribute reduction and genetic algorithm and regarding the significance of attributes as heuristic information,the heuristic information is introduced into genetic algorithm,and an effective heurisitic genetic algorithm is proposed.A new mutate operator is used for introducing the heurisitic information and the operator is a local research method using heurisitic information.So the algorithm converges quickly and has global optimizing ability.The results show that the method can calculate minimal reduction of decision charts quickly and effectively.

Key concepts: Rough set, Computer science, Reduction (mathematics), Algorithm, Genetic algorithm, Decision table, Heuristic, Set (abstract data type)

Related papers

Back to paper searchBrowse research topicsOriginal source
Attribute reduction algorithm for rough set based on improving genetic algorithm — Research Paper | ScholarLens