2016
DOI: 10.1002/cpe.3830
|View full text |Cite
|
Sign up to set email alerts
|

Attribute reduction in decision‐theoretic rough set model based on minimum decision cost

Abstract: SUMMARYAttribute reduction is one of the most important topics in rough set theory. In the classical rough sets, the method for attribute reduction is mainly to keep positive region, boundary region, and negative region unchanged. However, the three regions are no longer monotonic with respect to adding or deleting an attribute in decision-theoretic rough sets. In decision-theoretic rough set model, the decision regions are determined by using the Bayesian decision procedure, and decision-making should take co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(3 citation statements)
references
References 51 publications
0
3
0
Order By: Relevance
“…What's more, the RS theory reduces attributes based on the partition of equivalence relation, which can be accomplished through the evaluation metric [30,31], like mutual information and information entropy [10,38]. In general, the RS theory achieves better performance on the categorical attribute dataset [1,11]. The PCA reduces dimensions based on the variance additivity of irrelevant principal components [21,22], which can be evaluated by the contribution rate [19,27].…”
Section: Literature Review 21 Index System Reduction Algorithmsmentioning
confidence: 99%
“…What's more, the RS theory reduces attributes based on the partition of equivalence relation, which can be accomplished through the evaluation metric [30,31], like mutual information and information entropy [10,38]. In general, the RS theory achieves better performance on the categorical attribute dataset [1,11]. The PCA reduces dimensions based on the variance additivity of irrelevant principal components [21,22], which can be evaluated by the contribution rate [19,27].…”
Section: Literature Review 21 Index System Reduction Algorithmsmentioning
confidence: 99%
“…Classical rough sets mainly deal with discrete data, while information tables in the real world can be quite complicated, and many value measurements are given as continuous data, such as temperature, time and voltage. Classical rough sets cannot be used for approximation relation representation of interval data in uncertain systems (Hu, 2016; Liang, 2015; Gu, 2015; Bi et al , 2016). The grey system (Deng, 1988) is an efficient tool for interval data processing (Deng, 1988; Liu, 2006; Nagai and Yamaguchi, 2004), hence, grey rough sets provide a new tool for knowledge acquisition from uncertain information systems, especially for the interval-valued information system (Yao, 1993, 1996; Yeung and Chen, 2005).…”
Section: Introductionmentioning
confidence: 99%
“…X. Wei then present a novel search pattern named ExNa by defining its model and basic operations in detail. Two attribute reduction methods based on minimum decision cost are proposed by Z. Bi from the algebraic view and the information theory, respectively. Y. Wang designs an optimization algorithm to solve the problem.…”
mentioning
confidence: 99%