Attribute reduction in decision-theoretic rough set model: A further investigation

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

Abstract

The monotonicity of positive region in PRS (Pawlak Rough Set) and DTRS (Decision-Theoretic Rough Set) are comparatively discussed in this paper. Theoretic analysis shows that the positive region in DTRS model may expand with the decrease of the attributes, which is essentially different from that of PRS model and leads to a new definition of attribute reduction in DTRS model. A heuristic algorithm for the newly defined attribute reduction in DTRS model is proposed, in which the positive region is allowed to expand instead of remaining unchanged in the process of deleting attributes. Results of experimental analysis are included to validate the theoretic analysis and quantify the effectiveness of the proposed attribute reduction algorithm. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, H., Zhou, X., Zhao, J., & Liu, D. (2011). Attribute reduction in decision-theoretic rough set model: A further investigation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6954 LNAI, pp. 466–475). https://doi.org/10.1007/978-3-642-24425-4_61

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