A Parallel Matrix-Based Approach for Computing Approximations in Dominance-Based Rough Sets Approach
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 DRSA and 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.
Rough sets Dominance relation Approximations Parallel computing GPU
Shaoyong Li Tianrui Li
School of Information Science and Technology, Southwest Jiaotong University,Chengdu, 610031, China
国际会议
The 9th International Conference on Rough Sets and Knowledge Technology (RSKT 2014)(第九届粗糙集与知识技术国际会议)
上海
英文
173-183
2014-10-24(万方平台首次上网日期,不代表论文的发表时间)