Attribute Reduction Based on MapReduce Model and Discernibility Measure
Michał Czołombitko, Jarosław Stepaniuk · Lecture notes in computer science · 2016
This paper discusses two important problems of data reduction. The problems are related to computing reducts and core in rough sets. The authors use the fact that the necessary information about discernibility matrices can be computed directly from data tables, in the case of this paper so called counting tables are used. The discussed problems are of high computational complexity. Hence the authors propose to use the relevant heuristics, MRCR ( M ap R educe C ore and R educt Generation) implemented using the MapReduce model.