.png){kind=icon}
.png){kind=icon}
Return
A novel variable precision rough set attribute reduction algorithm based on local attribute significance
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijar.2023.03.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In attribute reduction, the method of partitioning information granules is crucial; however, the existing attribute reduction algorithms have limitations in this respect. To solve this problem, this study proposes the concept of an (alpha, beta)-indiscernibility relation. This is a fresh partition approach for information granules, tolerating a certain degree of error information. On the basis of this concept, we propose a novel (alpha, beta)-rough set model. Then we use this model to design a novel attribute reduction algorithm based on local attribute significance. To maintain the objectivity of this research and ensure fairness of the experiments, we present an integrated classifier to achieve the greatest classification accuracy. Ultimately, the experimental results verify that the fault-tolerance ability of information granules is increased. Moreover, the novel attribute reduction algorithm deletes redundant attributes and noise attributes to increase classification accuracy. In the later part of the experiment, different proportions of random Gaussian noise are added to each data set. The experimental results demonstrate the robustness and superiority of the new algorithm. (c) 2023 Elsevier Inc. All rights reserved.
Keywords:
(?
?)-Indiscernibility relation
?)-Rough set
Local attribute significance
Information granules
Attribute reduction
Journal
IF:
3
Papers:
2.9K
Citations:
5.1K