Attribute reduction for massive data based on rough set theory and mapreduce

N/ACitations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Data processing and knowledge discovery for massive data is always a hot topic in data mining, along with the era of cloud computing is coming, data mining for massive data is becoming a highlight research topic. In this paper, attribute reduction for massive data based on rough set theory is studied. The parallel programming mode of MapReduce is introduced and combined with the attribute reduction algorithm of rough set theory, a parallel attribute reduction algorithm based on MapReduce is proposed, experiment results show that the proposed method is more efficiency for massive data mining than traditional method, and it is a effective method effective method effective method for data mining on cloud computing platform. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Yang, Y., Chen, Z., Liang, Z., & Wang, G. (2010). Attribute reduction for massive data based on rough set theory and mapreduce. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6401 LNAI, pp. 672–678). https://doi.org/10.1007/978-3-642-16248-0_91

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free