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

DOI10.1007/978-3-319-11740-9_17MaRDI QIDQ2949607zbMATH OpenOpenAlexFDO

Authors Shaoyong Li, Tianrui Li

Publication date 2 October 2015

Published in Rough Sets and Knowledge Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-11740-9_17

zbMATH Keywords

approximationsdominance relationGPUparallel computingrough sets

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37) Parallel algorithms in computer science (68W10)

Recommendations

• Dominance-based rough approximation and knowledge reduction: a class-based approach
• Quality of Rough Approximation in Multi-criteria Classification Problems
• Rough approximation by dominance relations
• Efficient parallel Boolean matrix based algorithms for computing composite rough set approximations
• Dominance-based rough set approach: basic ideas and main trends

Cited in

(4)

• Efficient parallel Boolean matrix based algorithms for computing composite rough set approximations
• Parallel attribute reduction in dominance-based neighborhood rough set
• An Improved Parallel Method for Computing Rough Set Approximations
• Computing Approximations of Dominance-Based Rough Sets by Bit-Vector Encodings

Describes a project that uses

Uses Software

• UCI

This page was built for publication: A parallel matrix-based approach for computing approximations in dominance-based rough sets approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949607)