Multicost Decision-theoretic rough sets based on maximal consistent blocks

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Decision-theoretic rough set comes from Bayesian decision procedure, in which a pair of the thresholds is derived by the cost matrix for the construction of probabilistic rough set. However, classical decision-theoretic rough set can only be used to deal with complete information systems. Moreover, it does not take the property of variation of cost into consideration. To solve above two problems, the maximal consistent block is introduced into the construction of decision-theoretic rough set by using multiple cost matrixes. Our approach includes optimistic and pessimistic multicost decision-theoretic rough set models. Furthermore, the whole decision costs of optimistic and pessimistic multicost decision-theoretic rough sets are calculated in decision systems. This study suggests potential application areas and new research trends concerning decision-theoretic rough set.

Cite

CITATION STYLE

APA

Ma, X. B., Yang, X. B., Yang, X. B., Qi, Y., Song, X. N., Yang, J. Y., & Yang, X. B. (2014). Multicost Decision-theoretic rough sets based on maximal consistent blocks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8818, pp. 824–833). Springer Verlag. https://doi.org/10.1007/978-3-319-11740-9_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free