Clustering Algorithms

View at publisher
Authors: Vinod Kumar Khanna
Cited by: 0

Abstract

In this chapter, key aspects of clustering analysis are presented. Clustering is compared to regression. Types of clustering are distinguished. Details of centroid-based clustering, density-based clustering, distribution-based clustering, and hierarchical or connectivity-based clustering are provided. Centroid-based clustering groups data points into clusters based on their proximity to cluster centroids (mean or medoid). Density-based clustering identifies clusters as areas of high density separated by regions of low density. Distribution-based clustering assumes that data points belong to different probability distributions (e.g., Gaussian), and identifies clusters based on these distributions. Hierarchical clustering builds a hierarchy of clusters, represented as a dendrogram. Clusters are merged (agglomerative) or split (divisive) based on distance or similarity. A comparison is made between these clustering algorithms.

Fields of Study & Subjects

Advanced Clustering Algorithms Research Data Mining and Machine Learning Applications Bayesian Methods and Mixture Models

Publication details

Journal / source
Chapman & Hall/CRC eBooks
Pages
135–146
Publication date
6 February 2026
Language
EN
Document type
Book chapter