scholarly journals Attribute Reduction-Based Ensemble Rule Classifiers Method for Dataset Classification

2017 ◽  
Author(s):  
Mohammad Aizat bin Basir ◽  
Faudziah binti Ahmad
Keyword(s):  
Attribute Reduction

Application of an attribute reduction algorithm based on discernibility matrix in PBNM

2014 ◽  
Author(s):  
Shuo Feng ◽  
Haiying Chu ◽  
Xuyang Wang ◽  
Yuanka Liang ◽  
Xianwei Shi ◽  
...  
Keyword(s):  
Attribute Reduction ◽  
Reduction Algorithm ◽  
Discernibility Matrix

Minimum attribute reduction algorithm based on quick extraction and multi-strategy social spider optimization

2021 ◽  
pp. 1-16
Author(s):  
Qianjin Wei ◽  
Chengxian Wang ◽  
Yimin Wen
Keyword(s):  
Rough Set Theory ◽  
Attribute Reduction ◽  
Search Space ◽  
Initial State ◽  
Solution Quality ◽  
Social Spider ◽  
Opposition Based Learning ◽  
Social Spider Optimization ◽  
Intelligent Optimization Algorithm ◽  
Redundancy Detection

Intelligent optimization algorithm combined with rough set theory to solve minimum attribute reduction (MAR) is time consuming due to repeated evaluations of the same position. The algorithm also finds in poor solution quality because individuals are not fully explored in space. This study proposed an algorithm based on quick extraction and multi-strategy social spider optimization (QSSOAR). First, a similarity constraint strategy was called to constrain the initial state of the population. In the iterative process, an adaptive opposition-based learning (AOBL) was used to enlarge the search space. To obtain a reduction with fewer attributes, the dynamic redundancy detection (DRD) strategy was applied to remove redundant attributes in the reduction result. Furthermore, the quick extraction strategy was introduced to avoid multiple repeated computations in this paper. By combining an array with key-value pairs, the corresponding value can be obtained by simple comparison. The proposed algorithm and four representative algorithms were compared on nine UCI datasets. The results show that the proposed algorithm performs well in reduction ability, running time, and convergence speed. Meanwhile, the results confirm the superiority of the algorithm in solving MAR.

scholarly journals Parametric Matroid of Rough Set

2015 ◽  
Vol 23 (06) ◽  
pp. 893-908 ◽  
Author(s):  
Yanfang Liu ◽  
Hong Zhao ◽  
William Zhu
Keyword(s):  
Rough Set ◽  
Equivalence Relation ◽  
Rough Sets ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Independent Set ◽  
Approximation Operator ◽  
Approximation Number ◽  
Lower Approximation ◽  
The One

Rough set is mainly concerned with the approximations of objects through an equivalence relation on a universe. Matroid is a generalization of linear algebra and graph theory. Recently, a matroidal structure of rough sets is established and applied to the problem of attribute reduction which is an important application of rough set theory. In this paper, we propose a new matroidal structure of rough sets and call it a parametric matroid. On the one hand, for an equivalence relation on a universe, a parametric set family, with any subset of the universe as its parameter, is defined through the lower approximation operator. This parametric set family is proved to satisfy the independent set axiom of matroids, therefore a matroid is generated, and we call it a parametric matroid of the rough set. Through the lower approximation operator, three equivalent representations of the parametric set family are obtained. Moreover, the parametric matroid of the rough set is proved to be the direct sum of a partition-circuit matroid and a free matroid. On the other hand, partition-circuit matroids are well studied through the lower approximation number, and then we use it to investigate the parametric matroid of the rough set. Several characteristics of the parametric matroid of the rough set, such as independent sets, bases, circuits, the rank function and the closure operator, are expressed by the lower approximation number.

Radiator threat evaluation with missing data based on improved technique for order preference by similarity to ideal solution

2021 ◽  
pp. 1-10
Author(s):  
Yu-Heng Xu ◽  
Si-Yi Cheng ◽  
Hu-Biao Zhang
Keyword(s):  
Missing Data ◽  
Prior Knowledge ◽  
Attribute Reduction ◽  
Estimation Algorithm ◽  
Weighted Averaging ◽  
Ideal Solution ◽  
Attribute Weights ◽  
Order Preference ◽  
Improved Technique ◽  
Threat Evaluation

To solve the problem of the missing data of radiator during the aerial war, and to address the problem that traditional algorithms rely on prior knowledge and specialized systems too much, an algorithm for radiator threat evaluation with missing data based on improved Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) has been proposed. The null estimation algorithm based on Induced Ordered Weighted Averaging (IOWA) is adopted to calculate the aggregate value for predicting missing data. The attribute reduction is realized by using the Rough Sets (RS) theory, and the attribute weights are reasonably allocated with the theory of Shapley. Threat degrees can be achieved through quantization and ranking of radiators by constructing a TOPSIS decision space. Experiment results show that this algorithm can solve the incompleteness of radiator threat evaluation, and the ranking result is in line with the actual situation. Moreover, the proposed algorithm is highly automated and does not rely on prior knowledge and expert systems.

Sign in / Sign up

Export Citation Format

Share Document