A parallel matrix-based approach for computing approximations in dominance-based rough sets approach

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

Abstract

Dominance-based Rough Sets Approach (DRSA) is a useful tool for multi-criteria classification problems solving. Parallel computing is an efficient way to accelerate problems solving. Computation of approximations is a vital step to find the solutions with rough sets methodologies. In this paper, we propose a matrix-based approach for computing approximations in DRSAand design the corresponding parallel algorithms on Graphics Processing Unit (GPU). A numerical example is employed to illustrate the feasibility of the matrix-based approach. Experimental evaluations show the performance of the parallel algorithm.

Cite

CITATION STYLE

APA

Li, S., & Li, T. (2014). A parallel matrix-based approach for computing approximations in dominance-based rough sets approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8818, pp. 173–183). Springer Verlag. https://doi.org/10.1007/978-3-319-11740-9_17

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