Extended K-means algorithm

Faliu Yi, Inkyu Moon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

14 Scopus citations

Abstract

In the conventional K-means algorithm, the input data are automatically grouped into corresponding cluster by minimizing the within-cluster sum of squares. However, the traditional K-means algorithm doesn't do any constraints to the number of elements in each group. In the area of logistics management, each cluster will need to satisfy with a predefined number of elements. Thus, the clustering algorithm with controlled number of elements in each group is necessary. In this paper, we present a new method called extended k-means algorithm to extend the ordinary K-means approach. In this approach, the number of element in each group is adjusted by using greedy algorithm and the experimental results show that this extended K-means algorithm can work well for grouping data where the numbers of elements in each group need to be restrained.

Original languageEnglish
Title of host publicationProceedings - 2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics, IHMSC 2013
Pages263-266
Number of pages4
DOIs
StatePublished - 2013
Event2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics, IHMSC 2013 - Hangzhou, Zhejiang, China
Duration: 26 Aug 201327 Aug 2013

Publication series

NameProceedings - 2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics, IHMSC 2013
Volume2

Conference

Conference2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics, IHMSC 2013
Country/TerritoryChina
CityHangzhou, Zhejiang
Period26/08/1327/08/13

Keywords

  • Extended k-means algorithm
  • Greedy algorithm
  • K-means algorithm
  • Logistic management
  • Pattern classification

Fingerprint

Dive into the research topics of 'Extended K-means algorithm'. Together they form a unique fingerprint.

Cite this