Development of assessment criteria for clustering algorithms

  • Authors:

  • Sameh A. Salem;Asoke K. Nandi

  • Affiliations:

  • The University of Liverpool, Signal Processing and Communications Group, Department of Electrical Engineering and Electronics, Brownlow Hill, L69 3GJ, Liverpool, UK;The University of Liverpool, Signal Processing and Communications Group, Department of Electrical Engineering and Electronics, Brownlow Hill, L69 3GJ, Liverpool, UK

  • Venue:
  • Pattern Analysis & Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, new measures—called clustering performance measures (CPMs)—for assessing the reliability of a clustering algorithm are proposed. These CPMs are defined using a validation measure, which determines how well the algorithm works with a given set of parameter values, and a repeatability measure, which is used for studying the stability of the clustering solutions and has the ability to estimate the correct number of clusters in a dataset. These proposed CPMs can be used to evaluate clustering algorithms that have a structure bias to certain types of data distribution as well as those that have no structure biases. Additionally, we propose a novel cluster validity index, V I index, which is able to handle non-spherical clusters. Five clustering algorithms on different types of real-world data and synthetic data are evaluated. The first dataset type refers to a communications signal dataset representing one modulation scheme under a variety of noise conditions, the second represents two breast cancer datasets, while the third type represents different synthetic datasets with arbitrarily shaped clusters. Additionally, comparisons with other methods for estimating the number of clusters indicate the applicability and reliability of the proposed cluster validity V I index and repeatability measure for correct estimation of the number of clusters.