Return
Efficient parallel algorithm for computing rough set approximation on GPU
DOI:10.1007/s00500-018-3050-z.png)
Abstract
En 中文
Computation of rough set approximation (RSA) is a critical step for attribute reduction and knowledge acquisition in rough set theory. Continuously improving computation efficiency of RSA is very meaningful, because it can enhance user experience of existing applications. Furthermore, it is helpful to apply rough sets to some fields with high performance requirement. Graphics processing unit (GPU) has gained a lot of attention from scientific communities for its applicability in high-performance computing. Different from existing works, this paper tries to apply GPU to accelerate a state-of-the-art serial algorithm of RSA computation, which is based on radix sorting. Three key steps of the serial algorithm are parallel designed, including object sorting, computation of equivalence classes, and computation of RSA. The experimental results show that the parallel method can accelerate the computation process efficiently.
Keywords:
Rough set theory
Parallel computing
Rough set approximation
GPU
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers
Late gadolinium enhancement on cardiac magnetic resonance combined with 123I- metaiodobenzylguanidine scintigraphy strongly predicts long-term clinical outcome in patients with dilated cardiomyopathy
PLOS ONE
IF0
Minimal attribute reduction with rough set based on compactness discernibility information tree
SOFT COMPUTING
IF2.5
Sediment Mercury, Geomorphology and Land Use in the Middle Araguaia River Floodplain (Savanna Biome, Brazil)
Soil Systems
IF0
Modeling with linguistic entities and linguistic descriptors: a perspective of granular computing
SOFT COMPUTING
IF2.5

