%0 Journal Article
%A Cao, Thinh
%A Yamada, Koichi
%A Unehara, Muneyuki
%A Suzuki, Izumi
%A Nguyen, Do Van
%D 2018
%F SisLab:3296
%J Computers
%T Parallel Computation of Rough Set Approximations in Information Systems with Missing Decision Data
%U https://eprints.uet.vnu.edu.vn/eprints/id/eprint/3296/
%X The paper discusses the use of parallel computation to obtain rough set approximations from large-scale information systems where missing data exist in both condition and decision attributes. To date, many studies have focused on missing condition data, but very few have accounted for missing decision data, especially in enlarging datasets. One of the approaches for dealing with missing data in condition attributes is named twofold rough approximations. The paper aims to extend the approach to deal with missing data in the decision attribute. In addition, computing twofold rough approximations is very intensive, thus the approach is not suitable when input datasets are large. We propose parallel algorithms to compute twofold rough approximations in large-scale datasets. Our method is based on MapReduce, a distributed programming model for processing large-scale data. We introduce the original sequential algorithm first and then the parallel version is introduced. Comparison between the two approaches through experiments shows that our proposed parallel algorithms are suitable for and perform efficiently on large-scale datasets that have missing data in condition and decision attributes.