Enhancing parallel k-Means using map reduce for discovering knowledge from big data

Show simple item record

dc.contributor.author Moertini, Veronica Sri
dc.contributor.author Venica, Liptia
dc.date.accessioned 2017-05-02T06:33:27Z
dc.date.available 2017-05-02T06:33:27Z
dc.date.issued 2016
dc.identifier.uri http://hdl.handle.net/123456789/1545
dc.description Makalah dipresentasikan pada 2016 IEEE International Conference on Cloud Computing and Big Data Analysis (ICCCBDA 2016). IEEE, Sichuan Association for Science and Technology, Sichuan Institue of Electronics, Southwest Jiaotong University and Xihua University China. Chengdu, China, 5 - 7 July 2016. en_US
dc.description.abstract Knowledge discovery from data using clustering algorithm include stages of data preprocessing, clustering the preprocessed dataset and evaluating patterns for obtaining knowledge. Along with the popularity of Hadoop, k-Means algorithm has been enhanced based on MapReduce for clustering big dataset. We enhance this existing algorithm such that it includes the capabilities for performing data preprocessing, generating patterns and measures such that these can be used for evaluating the quality of clusters. Our preliminary experiment results in small Hadoop cluster indicate that our proposed technique performs well for clustering a case study big dataset. en_US
dc.publisher IEEE Computer Society Press en_US
dc.subject Map reduce en_US
dc.subject CLUSTERING BIG DATA en_US
dc.subject PARALLEL K-MEANS en_US
dc.title Enhancing parallel k-Means using map reduce for discovering knowledge from big data en_US
dc.type Conference Papers en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search UNPAR-IR


Advanced Search

Browse

My Account