Partitive clustering (K-means family)

  • Authors:

  • Yu Xiao;Jian Yu

  • Affiliations:

  • School of Computer and Information Technology, Beijing Jiatong University, Beijing, China;School of Computer and Information Technology, Beijing Jiatong University, Beijing, China

  • Venue:
  • Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Partitional clustering is an important part of cluster analysis. Cluster analysis can be considered as one of the the most important approaches to unsupervised learning. The goal of clustering is to find clusters from unlabeled data, which means that data belonging to the same cluster are as similar as possible, whereas data belonging to different clusters are as dissimilar as possible. Partitional clustering is categorized as a prototype-based model, i.e., each cluster can be represented by a prototype, leading to a concise description of the original data set. According to different definitions of prototypes, such as data point, hyperplane, and hypersphere, the clustering methods can be categorized into different types of clustering algorithms with various prototypes. Besides organizing these partitional clustering methods into such a unified framework, relations between some commonly used nonpartitional clustering methods and partitional clustering methods are also discussed here. We give a brief overview of clustering, summarize well-known partitional clustering methods, and discuss the major challenges and key issues of these methods. Simple numerical experiments using toy data sets are carried out to enhance the description of various clustering methods. © 2012 Wiley Periodicals, Inc. © 2012 Wiley Periodicals, Inc.