A Parallel Matrix-Based Method for Computing Approximations in Incomplete Information Systems

As the volume of data grows at an unprecedented rate, large-scale data mining and knowledge discovery present a tremendous challenge. Rough set theory, which has been used successfully in solving problems in pattern recognition, machine learning, and data mining, centers around the idea that a set o...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on knowledge and data engineering 2015-02, Vol.27 (2), p.326-339
Main Authors: Zhang, Junbo, Wong, Jian-Syuan, Pan, Yi, Li, Tianrui
Format: Article
Language:English
Subjects:
Approximation algorithms
Approximation methods
Computational modeling
Data mining
Information systems
Rough sets
Vectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:As the volume of data grows at an unprecedented rate, large-scale data mining and knowledge discovery present a tremendous challenge. Rough set theory, which has been used successfully in solving problems in pattern recognition, machine learning, and data mining, centers around the idea that a set of distinct objects may be approximated via a lower and upper bound. In order to obtain the benefits that rough sets can provide for data mining and related tasks, efficient computation of these approximations is vital. The recently introduced cloud computing model, MapReduce, has gained a lot of attention from the scientific community for its applicability to large-scale data analysis. In previous research, we proposed a MapReduce-based method for computing approximations in parallel, which can efficiently process complete data but fails in the case of missing (incomplete) data. To address this shortcoming, three different parallel matrix-based methods are introduced to process large-scale, incomplete data. All of them are built on MapReduce and implemented on Twister that is a lightweight MapReduce runtime system. The proposed parallel methods are then experimentally shown to be efficient for processing large-scale data.
ISSN:1041-4347
1558-2191
DOI:10.1109/TKDE.2014.2330821