An Attribute Reduction Method Based on Rough Set and SVM and with Application in Oil-Gas Prediction

Author(s):  
Yang Liu ◽  
Luyang Jiao ◽  
Guohua Bai ◽  
Boqin Feng

From the perspective of cognitive informatics, cognition can be viewed as the acquisition of knowledge. In real-world applications, information systems usually contain some degree of noisy data. A new model proposed to deal with the hybrid-feature selection problem combines the neighbourhood approximation and variable precision rough set models. Then rule induction algorithm can learn from selected features in order to reduce the complexity of rule sets. Through proposed integration, the knowledge acquisition process becomes insensitive to the dimensionality of data with a pre-defined tolerance degree of noise and uncertainty for misclassification. When the authors apply the method to a Chinese diabetic diagnosis problem, the hybrid-attribute reduction method selected only five attributes from totally thirty-four measurements. Rule learner produced eight rules with average two attributes in the left part of an IF-THEN rule form, which is a manageable set of rules. The demonstrated experiment shows that the present approach is effective in handling real-world problems.


Author(s):  
Yasuo Kudo ◽  
◽  
Tetsuya Murai ◽  

In this paper, we propose a parallel computation framework for a heuristic attribute reduction method. Attribute reduction is a key technique to use rough set theory as a tool in data mining. The authors have previously proposed a heuristic attribute reduction method to compute as many relative reducts as possible from a given dataset with numerous attributes. We parallelize our method by using open multiprocessing. We also evaluate the performance of a parallelized attribute reduction method by experiments.


2016 ◽  
Vol 693 ◽  
pp. 1346-1349
Author(s):  
Xiao Yu Chen ◽  
Wen Liao Du ◽  
An Sheng Li ◽  
Kun Li ◽  
Chun Hua Qian

Rough set theory is a useful tool for attribute reduction of fault diagnosis for rotating machinery, but cannot be efficiently used to sample increased areas. Aiming at the problem of incremental attribute reduction, a novel attribute reduction algorithm was put forward based on the binary resolution matrix for the two updating situations and the algorithm had a low space complex. Finally, with the fault diagnosis experiments of the bearing, the attribute reduction method was proved to be correct.


2008 ◽  
Vol 12 (1) ◽  
pp. 73-87 ◽  
Author(s):  
Yun-Huoy Choo ◽  
Azuraliza Abu Bakar ◽  
Abdul Razak Hamdan

2011 ◽  
Vol 50-51 ◽  
pp. 605-609
Author(s):  
Yan Hong Xie

Attribute reduction of rough set is a very important research topic. The shortcoming of Reference [8,9]’s method is got a superset of a true reduction sometimes, and the disadvantage of Reference [10]’s algorithm is could not get a right attribute reduction sometimes. To overcome the above shortcomings, a new heuristic attribute reduction method based on Boolean matrix is put forward. Finally, the method’s feasibility and validity are proved by examples.


2010 ◽  
Vol 108-111 ◽  
pp. 568-573
Author(s):  
E Xu ◽  
Liang Shan Shao ◽  
Zhu Qiao ◽  
Guang Hui Cao ◽  
Feng Qiu

To attribute reduction in an uncertain information system, this paper proposed a method of attribute reduction based on rough set theory. This reduction method gives the concepts of tolerance relationship, attribute significance and tolerance relationship similar matrix to deal with the inconsistency problem of in the information table. And then obtains the core attributes of incomplete information systems via the tolerance relationship similar matrix. Finally, according to attribute frequency in the tolerance relationship similar matrix, as the heuristic knowledge, makes use of binsearch heuristic algorithm to calculate the candidate attribute expansion so that it can reduce the expansion times to speed up reduction. Experiment results show that the algorithm is simple and effective.


2019 ◽  
Vol 154 ◽  
pp. 194-198
Author(s):  
Shi Qiang Wang ◽  
Cai Yun Gao ◽  
Chang Luo ◽  
Gui Mei Zheng ◽  
Yan Nian Zhou

Sign in / Sign up

Export Citation Format

Share Document