DBCURE-MR: An efficient density-based clustering algorithm for large data using MapReduce
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Younghoon | - |
dc.contributor.author | Shim, Kyuseok | - |
dc.contributor.author | Kim, Min-Soeng | - |
dc.contributor.author | Lee, June Sup | - |
dc.date.accessioned | 2021-06-22T23:22:46Z | - |
dc.date.available | 2021-06-22T23:22:46Z | - |
dc.date.issued | 2014-06 | - |
dc.identifier.issn | 0306-4379 | - |
dc.identifier.issn | 1873-6076 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/22821 | - |
dc.description.abstract | Clustering is a useful data mining technique which groups data points such that the points within a single group have similar characteristics, while the points in different groups are dissimilar. Density-based clustering algorithms such as DBSCAN and OPTICS are one kind of widely used clustering algorithms. As there is an increasing trend of applications to deal with vast amounts of data, clustering such big data is a challenging problem. Recently, parallelizing clustering algorithms on a large cluster of commodity machines using the MapReduce framework have received a lot of attention. In this paper, we first propose the new density-based clustering algorithm, called DBCURE, which is robust to find clusters with varying densities and suitable for parallelizing the algorithm with MapReduce. We next develop DBCURE-MR, which is a parallelized DBCURE using MapReduce. While traditional density-based algorithms find each cluster one by one, our DBCURE-MR finds several clusters together in parallel. We prove that both DBCURE and DBCURE-MR find the clusters correctly based on the definition of density-based clusters. Our experimental results with various data sets confirm that DBCURE-MR finds clusters efficiently without being sensitive to the clusters with varying densities and scales up well with the MapReduce framework. (C) 2013 Published by Elsevier Ltd. | - |
dc.format.extent | 21 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Elsevier Science & Technology | - |
dc.title | DBCURE-MR: An efficient density-based clustering algorithm for large data using MapReduce | - |
dc.type | Article | - |
dc.publisher.location | 영국 | - |
dc.identifier.doi | 10.1016/j.is.2013.11.002 | - |
dc.identifier.scopusid | 2-s2.0-84896527723 | - |
dc.identifier.wosid | 000333785700002 | - |
dc.identifier.bibliographicCitation | Information Systems, v.42, pp 15 - 35 | - |
dc.citation.title | Information Systems | - |
dc.citation.volume | 42 | - |
dc.citation.startPage | 15 | - |
dc.citation.endPage | 35 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | sci | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordAuthor | Clustering algorithm | - |
dc.subject.keywordAuthor | Density-based clustering | - |
dc.subject.keywordAuthor | Parallel algorithm | - |
dc.subject.keywordAuthor | MapReduce | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0306437913001634?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.