Skip to main navigation Skip to search Skip to main content

Novel partitional clustering algorithm for large data processing

  • Zhi Mao Lu*
  • , Jin Mei Feng
  • , Dong Mei Fan
  • , Peng Yang
  • , Ye Tian
  • *Corresponding author for this work
  • Harbin Engineering University
  • Dalian University of Technology
  • Heilongjiang University of Science and Technology
  • Harbin Normal University

Research output: Contribution to journalArticlepeer-review

Abstract

Large data processing is an inevitable problem for the internet of things research and application. To solve the shortcomings of large data processing with the common clustering methods, a novel partitional clustering method is designed. The new method determines the initial positions of natural cluster centroids by clustering the samples in sizes large enough, which are selected using the large data sampling method repeatedly. Next it updates the initial positions using the remaining data to correct the centroids positions deviating from the ideal positions. The designed partitional clustering algorithm has linear space and time complexity. The experimental results show that this new clustering algorithm can not only give better clustering results than common clustering algorithms, but also run fast and be suitable for large data clustering processing.

Original languageEnglish
Pages (from-to)1010-1015
Number of pages6
JournalXi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics
Volume36
Issue number5
DOIs
StatePublished - May 2014
Externally publishedYes

Keywords

  • Centroid
  • Internet of things
  • Large data
  • Partitional clustering
  • Sampling

Fingerprint

Dive into the research topics of 'Novel partitional clustering algorithm for large data processing'. Together they form a unique fingerprint.

Cite this