An Efficient Algorithm for Pawlak Reduction Based on Simplified Discernibility Matrix

DOI10.1007/978-3-540-88914-4_75zbMath1211.68441OpenAlexW2407618088MaRDI QIDQ3079440

Bing-Ru Yang, Zhang-Yan Xu

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

complexitydiscernibility matrixrough setattribute reductionsimplified discernibility matrix

Mathematics Subject Classification ID

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

This page was built for publication: An Efficient Algorithm for Pawlak Reduction Based on Simplified Discernibility Matrix