Distributed approach for computing rough set approximations of big incomplete information systems
From MaRDI portal
Publication:2056292
DOI10.1016/j.ins.2020.08.049zbMath1475.68381OpenAlexW3082688022WikidataQ114167435 ScholiaQ114167435MaRDI QIDQ2056292
Ahmed Sobhy, Hamed Nassar, Ahmed Hamed
Publication date: 2 December 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2020.08.049
Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational aspects of data analysis and big data (68T09)
Related Items (3)
Decision analysis review on the concept of class for bipolar soft set theory ⋮ Novel group decision making approach based on the rough soft approximations of graphs and hypergraphs ⋮ Matrix-based approaches for updating three-way regions in incomplete information systems with the variation of attributes
Uses Software
Cites Work
- Unnamed Item
- Parallel attribute reduction algorithms using MapReduce
- Efficient parallel Boolean matrix based algorithms for computing composite rough set approximations
- Generalized rough set models determined by multiple neighborhoods generated from a similarity relation
- Characteristic sets and generalized maximal consistent blocks in mining incomplete data
- On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts
- Parallel attribute reduction in dominance-based neighborhood rough set
- Maximal similarity granular rough sets for mixed and incomplete information systems
- Maximal limited similarity-based rough set model
- Missing Template Decomposition Method and Its Implementation in Rough Set Exploration System
- Describing Rough Approximations by Indiscernibility Relations in Information Tables with Incomplete Information
This page was built for publication: Distributed approach for computing rough set approximations of big incomplete information systems
