ScholarLens Back to search
2009•Microcomputer InformationRequires access

The Heuristic Algorithm for Reduction Based on Rough Set Theory

Ya Liu

Open publisher page 0 citations

Abstract

This paper researches attributes reduction of Rough Set Theory. Put forward a heuristic attribute reduction algorithm based on the attribute significance and attribute relevance at same time. the experimental results show that the algorithm is verified to be more feasible and effective.

About this research paper

What this paper is about

This paper researches attributes reduction of Rough Set Theory. Put forward a heuristic attribute reduction algorithm based on the attribute significance and attribute relevance at same time. the experimental results show that the algorithm is verified to be more feasible and effective.

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

This paper researches attributes reduction of Rough Set Theory. Put forward a heuristic attribute reduction algorithm based on the attribute significance and attribute relevance at same time. the experimental results show that the algorithm is verified to be more feasible and effective.

Key concepts: Rough set, Computer science, Reduction (mathematics), Heuristic, Algorithm, Relevance (law), Set (abstract data type), Attribute domain

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The Heuristic Algorithm for Reduction Based on Rough Set Theory — Research Paper | ScholarLens