scholarly journals Neighborhood Based Multi-Granularity Attribute Reduction: An Acceleration Approach

2020 ◽  
Author(s):  
Jingjing Song ◽  
Huili Dou ◽  
Xiansheng Rao ◽  
Xiaojing Luo ◽  
Xuan Yan
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Superior Performance ◽  
Data Sets ◽  
Feature Selection Technique ◽  
Elapsed Time ◽  
Multiple Granularities ◽  
Naive Approach

As a feature selection technique in rough set theory, attribute reduction has been extensively explored from various viewpoints especially the aspect of granularity, and multi-granularity attribute reduction has attracted much attention. Nevertheless, it should be pointed out that multiple granularities require to be considered simultaneously to evaluate the significance of candidate attribute in the corresponding process of computing reduct, which may result in high elapsed time of searching reduct. To alleviate such a problem, an acceleration strategy for neighborhood based multi-granularity attribute reduction is proposed in this paper, which aims to improve the computational efficiency of searching reduct. Our proposed approach is actually realized through the positive approximation mechanism, and the processes of searching qualified attributes are executed through evaluating candidate attributes over the gradually reduced sample space rather than all samples. The experimental results over 12 UCI data sets demonstrate that the acceleration strategy can provide superior performance to the naive approach of deriving multi-granularity reduct in the elapsed time of computing reduct without generating different reducts.

The Incremental Knowledge Acquisition Based on Hash Algorithm

2016 ◽  
Vol 24 (03) ◽  
pp. 347-366 ◽  
Author(s):  
Qing-Hua Zhang ◽  
Long-Yang Yao ◽  
Guan-Sheng Zhang ◽  
Yu-Ke Xin
Keyword(s):  
Knowledge Acquisition ◽  
Set Theory ◽  
Rough Set ◽  
Granular Computing ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Algorithm Analysis ◽  
Data Sets ◽  
Hash Algorithm ◽  
Acquisition Method

In this paper, a new incremental knowledge acquisition method is proposed based on rough set theory, decision tree and granular computing. In order to effectively process dynamic data, describing the data by rough set theory, computing equivalence classes and calculating positive region with hash algorithm are analyzed respectively at first. Then, attribute reduction, value reduction and the extraction of rule set by hash algorithm are completed efficiently. Finally, for each new additional data, the incremental knowledge acquisition method is proposed and used to update the original rules. Both algorithm analysis and experiments show that for processing the dynamic information systems, compared with the traditional algorithms and the incremental knowledge acquisition algorithms based on granular computing, the time complexity of the proposed algorithm is lower due to the efficiency of hash algorithm and also this algorithm is more effective when it is used to deal with the huge data sets.

scholarly journals An Attribute Reduction Method using Neighborhood Entropy Measures in Neighborhood Rough Sets

Entropy ◽  
2019 ◽  
Vol 21 (2) ◽  
pp. 155 ◽  
Author(s):  
Lin Sun ◽  
Xiaoyu Zhang ◽  
Jiucheng Xu ◽  
Shiguang Zhang
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Sets ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Classification Performance ◽  
Data Sets ◽  
Complex Data ◽  
Decision Systems ◽  
Neighborhood Rough Sets

Attribute reduction as an important preprocessing step for data mining, and has become a hot research topic in rough set theory. Neighborhood rough set theory can overcome the shortcoming that classical rough set theory may lose some useful information in the process of discretization for continuous-valued data sets. In this paper, to improve the classification performance of complex data, a novel attribute reduction method using neighborhood entropy measures, combining algebra view with information view, in neighborhood rough sets is proposed, which has the ability of dealing with continuous data whilst maintaining the classification information of original attributes. First, to efficiently analyze the uncertainty of knowledge in neighborhood rough sets, by combining neighborhood approximate precision with neighborhood entropy, a new average neighborhood entropy, based on the strong complementarity between the algebra definition of attribute significance and the definition of information view, is presented. Then, a concept of decision neighborhood entropy is investigated for handling the uncertainty and noisiness of neighborhood decision systems, which integrates the credibility degree with the coverage degree of neighborhood decision systems to fully reflect the decision ability of attributes. Moreover, some of their properties are derived and the relationships among these measures are established, which helps to understand the essence of knowledge content and the uncertainty of neighborhood decision systems. Finally, a heuristic attribute reduction algorithm is proposed to improve the classification performance of complex data sets. The experimental results under an instance and several public data sets demonstrate that the proposed method is very effective for selecting the most relevant attributes with great classification performance.

scholarly journals Knowledge Reduction Based on Divide and Conquer Method in Rough Set Theory

2012 ◽  
Vol 2012 ◽  
pp. 1-24 ◽  
Author(s):  
Feng Hu ◽  
Guoyin Wang
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Recognition Rate ◽  
Large Data ◽  
Divide And Conquer ◽  
Data Sets ◽  
Levels Of Abstraction ◽  
Knowledge Reduction

The divide and conquer method is a typical granular computing method using multiple levels of abstraction and granulations. So far, although some achievements based on divided and conquer method in the rough set theory have been acquired, the systematic methods for knowledge reduction based on divide and conquer method are still absent. In this paper, the knowledge reduction approaches based on divide and conquer method, under equivalence relation and under tolerance relation, are presented, respectively. After that, a systematic approach, named as the abstract process for knowledge reduction based on divide and conquer method in rough set theory, is proposed. Based on the presented approach, two algorithms for knowledge reduction, including an algorithm for attribute reduction and an algorithm for attribute value reduction, are presented. Some experimental evaluations are done to test the methods on uci data sets and KDDCUP99 data sets. The experimental results illustrate that the proposed approaches are efficient to process large data sets with good recognition rate, compared with KNN, SVM, C4.5, Naive Bayes, and CART.

An efficient ant colony optimization approach to attribute reduction in rough set theory

2008 ◽  
Vol 29 (9) ◽  
pp. 1351-1357 ◽  
Author(s):  
Liangjun Ke ◽  
Zuren Feng ◽  
Zhigang Ren
Keyword(s):  
Ant Colony Optimization ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Ant Colony ◽  
Optimization Approach

scholarly journals Attribute Reduction Based on Consistent Covering Rough Set and Its Application

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Jianchuan Bai ◽  
Kewen Xia ◽  
Yongliang Lin ◽  
Panpan Wu
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Relevance Vector Machine ◽  
Support Vector ◽  
Processing Step ◽  
Important Processing ◽  
Continuous Attribute ◽  
Covering Rough Set

As an important processing step for rough set theory, attribute reduction aims at eliminating data redundancy and drawing useful information. Covering rough set, as a generalization of classical rough set theory, has attracted wide attention on both theory and application. By using the covering rough set, the process of continuous attribute discretization can be avoided. Firstly, this paper focuses on consistent covering rough set and reviews some basic concepts in consistent covering rough set theory. Then, we establish the model of attribute reduction and elaborate the steps of attribute reduction based on consistent covering rough set. Finally, we apply the studied method to actual lagging data. It can be proved that our method is feasible and the reduction results are recognized by Least Squares Support Vector Machine (LS-SVM) and Relevance Vector Machine (RVM). Furthermore, the recognition results are consistent with the actual test results of a gas well, which verifies the effectiveness and efficiency of the presented method.

A Study on Bayesian Decision Theoretic Rough Set

2014 ◽  
Vol 1 (1) ◽  
pp. 1-14 ◽  
Author(s):  
Sharmistha Bhattacharya Halder
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Boundary Region ◽  
Data Sets ◽  
Bayesian Decision ◽  
Minimum Risk ◽  
Useful Knowledge ◽  
Research Fields ◽  
Hybrid Development

The concept of rough set was first developed by Pawlak (1982). After that it has been successfully applied in many research fields, such as pattern recognition, machine learning, knowledge acquisition, economic forecasting and data mining. But the original rough set model cannot effectively deal with data sets which have noisy data and latent useful knowledge in the boundary region may not be fully captured. In order to overcome such limitations, some extended rough set models have been put forward which combine with other available soft computing technologies. Many researchers were motivated to investigate probabilistic approaches to rough set theory. Variable precision rough set model (VPRSM) is one of the most important extensions. Bayesian rough set model (BRSM) (Slezak & Ziarko, 2002), as the hybrid development between rough set theory and Bayesian reasoning, can deal with many practical problems which could not be effectively handled by original rough set model. Based on Bayesian decision procedure with minimum risk, Yao (1990) puts forward a new model called decision theoretic rough set model (DTRSM) which brings new insights into the probabilistic approaches to rough set theory. Throughout this paper, the concept of decision theoretic rough set is studied and also a new concept of Bayesian decision theoretic rough set is introduced. Lastly a comparative study is done between Bayesian decision theoretic rough set and Rough set defined by Pawlak (1982).

scholarly journals Support or Risk? Software Project Risk Assessment Model Based on Rough Set Theory and Backpropagation Neural Network

2019 ◽  
Vol 11 (17) ◽  
pp. 4513 ◽  
Author(s):  
Xiaoqing Li ◽  
Qingquan Jiang ◽  
Maxwell K. Hsu ◽  
Qinglan Chen
Keyword(s):  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Assessment Model ◽  
Software Project ◽  
Risk Assessment Model ◽  
Backpropagation Neural Network ◽  
Model Based ◽  
Sample Data

Software supports continuous economic growth but has risks of uncertainty. In order to improve the risk-assessing accuracy of software project development, this paper proposes an assessment model based on the combination of backpropagation neural network (BPNN) and rough set theory (RST). First, a risk list with 35 risk factors were grouped into six risk categories via the brainstorming method and the original sample data set was constructed according to the initial risk list. Subsequently, an attribute reduction algorithm of the rough set was used to eliminate the redundancy attributes from the original sample dataset. The input factors of the software project risk assessment model could be reduced from thirty-five to twelve by the attribute reduction. Finally, the refined sample data subset was used to train the BPNN and the test sample data subset was used to verify the trained BPNN. The test results showed that the proposed joint model could achieve a better assessment than the model based only on the BPNN.

Research of Improved Attribute Reduction Algorithm Based on Data Mining of Rough Set

2014 ◽  
Vol 644-650 ◽  
pp. 2120-2123 ◽  
Author(s):  
De Zhi An ◽  
Guang Li Wu ◽  
Jun Lu
Keyword(s):  
Data Mining ◽  
Rough Set ◽  
Rough Set Theory ◽  
Attribute Reduction ◽  
Large Data ◽  
Large Data Sets ◽  
Data Sets ◽  
Reduction Algorithm ◽  
The Core ◽  
Rules Extraction

At present there are many data mining methods. This paper studies the application of rough set method in data mining, mainly on the application of attribute reduction algorithm based on rough set in the data mining rules extraction stage. Rough set in data mining is often used for reduction of knowledge, and thus for the rule extraction. Attribute reduction is one of the core research contents of rough set theory. In this paper, the traditional attribute reduction algorithm based on rough sets is studied and improved, and for large data sets of data mining, a new attribute reduction algorithm is proposed.

Sign in / Sign up

Export Citation Format

Share Document