Attribute reduction in ordered decision tables via evidence theory

2016 ◽  
Vol 364-365 ◽  
pp. 91-110 ◽  
Author(s):  
Wen Sheng Du ◽  
Bao Qing Hu
2018 ◽  
Vol 2018 (16) ◽  
pp. 1475-1482 ◽  
Author(s):  
Jia Zhang ◽  
Xiaoyan Zhang ◽  
Weihua Xu

2020 ◽  
Vol 28 (5) ◽  
pp. 858-873
Author(s):  
Nguyen Long Giang ◽  
Le Hoang Son ◽  
Tran Thi Ngan ◽  
Tran Manh Tuan ◽  
Ho Thi Phuong ◽  
...  

2016 ◽  
Vol 16 (4) ◽  
pp. 13-28 ◽  
Author(s):  
Cao Chinh Nghia ◽  
Demetrovics Janos ◽  
Nguyen Long Giang ◽  
Vu Duc Thi

Abstract According to traditional rough set theory approach, attribute reduction methods are performed on the decision tables with the discretized value domain, which are decision tables obtained by discretized data methods. In recent years, researches have proposed methods based on fuzzy rough set approach to solve the problem of attribute reduction in decision tables with numerical value domain. In this paper, we proposeafuzzy distance between two partitions and an attribute reduction method in numerical decision tables based on proposed fuzzy distance. Experiments on data sets show that the classification accuracy of proposed method is more efficient than the ones based fuzzy entropy.


2021 ◽  
pp. 1-13
Author(s):  
Tao Yin ◽  
Xiaojuan Mao ◽  
Xingtan Wu ◽  
Hengrong Ju ◽  
Weiping Ding ◽  
...  

Neighborhood classifier, a common classification method, is applied in pattern recognition and data mining. The neighborhood classifier mainly relies on the majority voting strategy to judge each category. This strategy only considers the number of samples in the neighborhood but ignores the distribution of samples, which leads to a decreased classification accuracy. To overcome the shortcomings and improve the classification performance, D-S evidence theory is applied to represent the evidence information support of other samples in the neighborhood, and the distance between samples in the neighborhood is taken into account. In this paper, a novel attribute reduction method of neighborhood rough set with a dynamic updating strategy is developed. Different from the traditional heuristic algorithm, the termination threshold of the proposed reduction algorithm is dynamically optimized. Therefore, when the attribute significance is not monotonic, this method can retrieve a better value, in contrast to the traditional method. Moreover, a new classification approach based on D-S evidence theory is proposed. Compared with the classical neighborhood classifier, this method considers the distribution of samples in the neighborhood, and evidence theory is applied to describe the closeness between samples. Finally, datasets from the UCI database are used to indicate that the improved reduction can achieve a lower neighborhood decision error rate than classical heuristic reduction. In addition, the improved classifier acquires higher classification performance in contrast to the traditional neighborhood classifier. This research provides a new direction for improving the accuracy of neighborhood classification.


2015 ◽  
Vol 14 (4) ◽  
pp. 3-10
Author(s):  
Demetrovics Janos ◽  
Vu Duc Thi ◽  
Nguyen Long Giang

Abstract The problem of finding reducts plays an important role in processing information on decision tables. The objective of the attribute reduction problem is to reject a redundant attribute in order to find a core attribute for data processing. The attribute reduction in decision tables is the process of finding a minimal subset of conditional attributes which preserve the classification ability of decision tables. In this paper we present the time complexity of the problem of finding all reducts of a consistent decision table. We prove that this time complexity is exponential with respect to the number of attributes of the decision tables. Our proof is performed in two steps. The first step is to show that there exists an exponential algorithm which finds all reducts. The other step is to prove that the time complexity of the problem of finding all reducts of a decision table is not less than exponential.


2020 ◽  
Vol 541 ◽  
pp. 36-59 ◽  
Author(s):  
Yunlong Cheng ◽  
Qinghua Zhang ◽  
Guoyin Wang ◽  
Bao Qing Hu

Sign in / Sign up

Export Citation Format

Share Document