Matrix-based rough set approach for dynamic probabilistic set-valued information systems

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

Abstract

Set-valued information systems (SvIS), in which the attribute values are set-valued, are important types of data representation with uncertain and missing information. However, all previous investigations in rough set community do not consider the attribute values with probability distribution in SvIS, which may be impractical in many real applications. This paper introduces probabilistic set-valued information systems (PSvIS) and presents an extended variable precision rough sets (VPRS) approach based on λ-tolerance relation for PSvIS. Furthermore, due to the dynamic variation of attributes in PSvIS, viz., the addition and deletion of attributes, we present a matrix characterization of the proposed VPRS model and discuss some related properties. Then incremental approaches for maintaining rough approximations based on matrix operations are presented, which can effectively accelerate the updating of rough approximations in dynamic PSvIS.

Cite

CITATION STYLE

APA

Huang, Y., Li, T., Luo, C., & Horng, S. J. (2016). Matrix-based rough set approach for dynamic probabilistic set-valued information systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9920 LNAI, pp. 197–206). Springer Verlag. https://doi.org/10.1007/978-3-319-47160-0_18

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