An Improved Parallel Method for Computing Rough Set Approximations

DOI10.1007/978-3-642-54924-3_3zbMATH Open1356.68233OpenAlexW1157804960MaRDI QIDQ2963697FDOQ2963697

Authors: Chuan Luo, Tianrui Li, Junbo Zhang, Anping Zeng, Hongmei Chen 

Publication date: 21 February 2017

Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54924-3_3

Recommendations

• Efficient parallel Boolean matrix based algorithms for computing composite rough set approximations
• A parallel matrix-based approach for computing approximations in dominance-based rough sets approach
• On scalability of rough set methods
• Parallel implementation of basic rough sets notions in cellular arrays
• Scalable Methods in Rough Sets

zbMATH Keywords

parallel computingrough setsapproximationsknowledge discovery

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• Rough sets
• Positive approximation: an accelerator for attribute reduction in rough set theory
• A rough set based dynamic maintenance approach for approximations in coarsening and refining attribute values
• Tree structure for efficient data mining using rough sets

Cited In (3)

• Scalable Methods in Rough Sets
• Parallel computation in finding near neighbourhoods
• Efficient parallel Boolean matrix based algorithms for computing composite rough set approximations

This page was built for publication: An Improved Parallel Method for Computing Rough Set Approximations

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