An efficient algorithm for Pawlak reduction based on simplified discernibility matrix

DOI10.1007/978-3-540-88914-4_75MaRDI QIDQ3079440zbMATH OpenOpenAlexFDO

Authors Zhang-Yan Xu, Bing Ru Yang

Publication date 2 March 2011

Published in Advances in Soft Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88914-4_75

zbMATH Keywords

attribute reductioncomplexitydiscernibility matrixrough setsimplified discernibility matrix

Mathematics Subject Classification ID

Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
• Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
• Reduction algorithms based on discernibility matrix: The ordered attributes method
• The attribute reduction algorithm based on parallel computing
• An algorithm for relative reduction based on simplified binary discernibility matrix

Cited in

(8)

• An efficient algorithm for Pawlak reduction based on simplified discernibility matrix
• scientific article; zbMATH DE number 6612574 (Why is no real title available?)
• Structural features of attribute reduction matrix and layer fast algorithm
• An efficient genetic reduction algorithm for rough sets
• Efficient algorithm of attribute reduction based on Skowron's discernibility matrix
• The attribute reduction algorithm based on parallel computing
• An algorithm for relative reduction based on simplified binary discernibility matrix
• Reduction algorithms based on discernibility matrix: The ordered attributes method

This page was built for publication: An efficient algorithm for Pawlak reduction based on simplified discernibility matrix

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