earticle

논문검색

SnIClustering Algorithm Based on Sampling and Filtering under the MapReduce Framework

초록

영어

SnIClustering Algorithm is put forward to deal with the large number of intermediate values when processing MapReduce. SnIClustering Algorithm picks up a few representative data through cluster sampling, and then retains the useful data through filtration according to the distribution characteristics. By doing so, intermediate values of MapReduce can be reduced sharply, saving time and easing network load. The last step is to cluster the selected data and samples. Experimental results show that SnIClustering is suitable to process large-scale data, since it can both process large-scale data within a short time and maintain fine clustering effect.

목차

Abstract
 1. Introduction
 2. Relevant Works
 3. SnIclustering Algorithms
  3.1. Algorithmic Thinking
  3.2. Algorithm Description
 4. Experimental Evaluation
  4.1. Data-set and Parameter
  4.2. Experimental Results and Analysis
 5. Conclusions
 Acknowledgements
 Referneces

저자정보

  • Fei Yang School of Computer Science and Technology, Hubei Polytechnic University, Huangshi, Hubei, China
  • Wan-zhen Zhang Guilin Unversity of Electronic Technology, Cuilin 541004, Guangxi, China
  • Wei Dai School of Economics and Mangement, Hubei Polytechnic University, Huangshi 435003. Hubei, China

참고문헌

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

    함께 이용한 논문

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

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