LRA: an accelerated rough set framework based on local redundancy of attribute for feature selection

10/31/2020
by   Shuyin Xia, et al.
0

In this paper, we propose and prove the theorem regarding the stability of attributes in a decision system. Based on the theorem, we propose the LRA framework for accelerating rough set algorithms. It is a general-purpose framework which can be applied to almost all rough set methods significantly . Theoretical analysis guarantees high efficiency. Note that the enhancement of efficiency will not lead to any decrease of the classification accuracy. Besides, we provide a simpler prove for the positive approximation acceleration framework.

READ FULL TEXT

page 1

page 2

page 3

research
12/29/2021

An Efficient and Accurate Rough Set for Feature Selection, Classification and Knowledge Representation

This paper present a strong data mining method based on rough set, which...
research
06/28/2011

Class-based Rough Approximation with Dominance Principle

Dominance-based Rough Set Approach (DRSA), as the extension of Pawlak's ...
research
06/23/2010

A Novel Rough Set Reduct Algorithm for Medical Domain Based on Bee Colony Optimization

Feature selection refers to the problem of selecting relevant features w...
research
01/10/2022

GBRS: An Unified Model of Pawlak Rough Set and Neighborhood Rough Set

Pawlak rough set and neighborhood rough set are the two most common roug...
research
05/17/2022

Construction of Rough graph to handle uncertain pattern from an Information System

Rough membership function defines the measurement of relationship betwee...
research
08/23/2011

Ant Colony Optimization of Rough Set for HV Bushings Fault Detection

Most transformer failures are attributed to bushings failures. Hence it ...
research
12/22/2015

Heuristic algorithms for finding distribution reducts in probabilistic rough set model

Attribute reduction is one of the most important topics in rough set the...

Please sign up or login with your details

Forgot password? Click here to reset