Fuzzy clustering algorithms and validity indices for distributed data

L. Vendramin, R. J.G.B. Campello, M. C. Naldi*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

Abstract

This chapter presents a unified framework to generalize a number of fuzzy clustering algorithms to handle distributed data in an exact way, i.e., with no approximation of results with respect to their original centralized versions. The same framework allows the exact distribution of relative validity indices used to evaluate the quality of fuzzy clustering solutions. Complexity analyses for each distributed algorithm and index are reported in terms of space, time, and communication aspects. A general procedure to estimate the number of clusters in a non–centralized fashion using the proposed framework is also described. Such a procedure is directly applicable not only to distributed data, but to parallel data processing scenarios as well. Experimental results illustrate the speedup obtained when running algorithms under the proposed framework in multiple cores of a processor, when compared to their traditional, centralized counterparts running in a single core. Additionally, the quality of the results and amount of data transmitted are assessed and compared among different fuzzy clustering algorithms.

Original languageEnglish
Title of host publicationPartitional Clustering Algorithms
EditorsM. Emre Celebi
PublisherSpringer
Publication date1. Jan 2015
Pages147-192
ISBN (Print)9783319092584
ISBN (Electronic)9783319092591
DOIs
Publication statusPublished - 1. Jan 2015
Externally publishedYes

Bibliographical note

Publisher Copyright:
© Springer International Publishing Switzerland 2015.

Keywords

  • Clustering
  • Distributed data
  • Fuzzy partitions
  • Parallel computing
  • Validity indices

Fingerprint

Dive into the research topics of 'Fuzzy clustering algorithms and validity indices for distributed data'. Together they form a unique fingerprint.

Cite this