Affinity Propagation, Fuzzy Clustering, and

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

Abstract

Affinity propagation, fuzzy clustering, and OPTICS are clustering algorithms with distinct characteristics and applications. Affinity propagation iteratively sends messages between data points to identify exemplars (representative data points) and assign other points to those exemplars. The mechanism of the affinity propagation algorithm, along with its advantages and disadvantages, is described. Fuzzy clustering allows data points to belong to multiple clusters with varying degrees of membership, unlike traditional clustering, where each point belongs to only one cluster. In the context of fuzzy clustering, membership grades and soft clustering are defined. The fuzzy C-means (FCM) algorithm is mentioned. The mechanism and applications of the fuzzy clustering algorithm are explained. OPTICS builds a reachability plot, which represents the sorted order of data points based on their reachability distance. This plot helps identify clusters of varying densities and shapes. Concerning the OPTICS , core distance and reachability distance are defined. The working mechanism of this algorithm is discussed. A comparison is made between affinity propagation, fuzzy clustering, and OPTICS .

Fields of Study & Subjects

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

Publication details

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