An empirical analysis on the stability of clustering algorithms

Reza Zafarani, Majid Makki, Ali A. Ghorbani

Research output: Chapter in Book/Entry/PoemConference contribution

1 Scopus citations

Abstract

One of the aspects of a clustering algorithm that should be considered for choosing an appropriate algorithm in an unsupervised learning task is stability. A clustering algorithm is stable (on a dataset) if it results in the same clustering as it performed on the whole dataset, when actually performs on a (sub)sample of the dataset. In this paper, we report the results of an empirical study on the stability of two clustering algorithms, namely k-Means and normalized spectral clustering, along with some analysis on those results that are useful for practitioners who deal with scalability and researchers who employ stability as a tool for model selection.

Original languageEnglish (US)
Title of host publicationProceedings - 20th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'08
Pages19-26
Number of pages8
DOIs
StatePublished - 2008
Externally publishedYes
Event20th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'08 - Dayton, OH, United States
Duration: Nov 3 2008Nov 5 2008

Publication series

NameProceedings - International Conference on Tools with Artificial Intelligence, ICTAI
Volume2
ISSN (Print)1082-3409

Other

Other20th IEEE International Conference on Tools with Artificial Intelligence, ICTAI'08
Country/TerritoryUnited States
CityDayton, OH
Period11/3/0811/5/08

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'An empirical analysis on the stability of clustering algorithms'. Together they form a unique fingerprint.

Cite this