The attribute reduction algorithm based on parallel computing
From MaRDI portal
Publication:4597758
DOI10.3233/JIFS-161137zbMATH Open1375.68107OpenAlexW2593339153MaRDI QIDQ4597758FDOQ4597758
Authors: Baohua Liang, Shangzhi Zheng, Lin Wang 
Publication date: 14 December 2017
Published in: Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/jifs-161137
Recommendations
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- A parallel reduction algorithm of ordered information systems based on attribute partition
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- Parallel attribute reduction algorithms using MapReduce
- Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
Reasoning under uncertainty in the context of artificial intelligence (68T37) Parallel algorithms in computer science (68W10)
Cited In (7)
- Parallel attribute reduction in dominance-based neighborhood rough set
- Rough Sets and Current Trends in Computing
- An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
- Rough Sets and Current Trends in Computing
- A parallel reduction algorithm of ordered information systems based on attribute partition
- Parallel attribute reduction algorithm for unlabeled data based on fuzzy discernibility matrix and soft deletion behavior
- Parallel attribute reduction algorithms using MapReduce
This page was built for publication: The attribute reduction algorithm based on parallel computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4597758)
