A decision-theoretic rough set approach to multi-class cost-sensitive classification

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

Abstract

As a kind of probabilistic rough set model, decision-theoretic rough set is usually used to deal with binary classification problems. This paper provides a new formulation of multi-class decision-theoretic rough set by combining decision-theoretic rough set model with classical cost-sensitive learning. Upper approximation, lower approximation, positive region, negative region and boundary region can be derived from the n × n cost matrix of classical multi-class situation. The probability thresholds for three-way decisions making are defined. A cost-sensitive classification algorithm based on multi-class decision-theoretic rough set model is presented. The experimental results on several UCI data sets indicate that the proposed algorithm can get a better performance on classification accuracy and total cost.

Cite

CITATION STYLE

APA

Deng, G., & Jia, X. (2016). A decision-theoretic rough set approach to multi-class cost-sensitive classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9920 LNAI, pp. 250–260). Springer Verlag. https://doi.org/10.1007/978-3-319-47160-0_23

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