earticle

논문검색

Research of parallel DBSCAN clustering algorithm based on MapReduce

초록

영어

For the lack of "density-based spatial clustering with noise" (DBSCAN) algorithm in dealing with large data sets, MapReduce programming model is proposed to achieve the clustering of DBSCAN. Map functions to complete the data analysis, and get clustering rules in different data objects; Then Reduce functions merge these clustering rules to get a final result. Experimental results show: the DBSCAN of MapReduce running on the cloud computing platform Hadoop has good speedup and scalability.

목차

Abstract
 1. Introduction
 2. MapReduce Programming Model
 3. DBSCAN Clustering Algorithm
 4. DBSCAN Algorithm based on MapReduce
  4.1. Feasibility Analysis
  4.2. The Realization of DBSCAN Algorithm based on MapReduce
 5. Analysis of Experimental Results
 6. Conclusion
 Acknowledgements
 References

저자정보

  • Xiufen Fu School of Computer, Guangdong University of Technology, 510006, P.R.China
  • Shanshan Hu School of Computer, Guangdong University of Technology, 510006, P.R.China
  • Yaguang Wang School of Computer, Guangdong University of Technology, 510006, P.R.China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.