Generalization of c-means for identifying non-disjoint clusters with overlap regulation - Archive ouverte HAL Access content directly
Journal Articles Pattern Recognition Letters Year : 2014

Generalization of c-means for identifying non-disjoint clusters with overlap regulation

Abstract

Clustering is an unsupervised learning method that enables to fit structures in unlabeled data sets. Detecting overlapping structures is a specific challenge involving its own theoretical issues but offering relevant solutions for many application domains. This paper presents generalizations of the c-means algorithm allowing the parametrization of the overlap sizes. Two regulation principles are introduced, that aim to control the overlap shapes and sizes as regard to the number and the dispersal of the cluster concerned. The experiments performed on real world datasets show the efficiency of the proposed principles and especially the ability of the second one to build reliable overlaps with an easy tuning and whatever the requirement on the number of clusters.
Fichier principal
Vignette du fichier
hal-00978269.pdf (5.7 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00978269 , version 1 (05-05-2014)

Identifiers

Cite

Chiheb-Eddine Ben N'Cir, Guillaume Cleuziou, Nadia Essoussi. Generalization of c-means for identifying non-disjoint clusters with overlap regulation. Pattern Recognition Letters, 2014, 45C, pp.92-98. ⟨10.1016/j.patrec.2014.03.007⟩. ⟨hal-00978269⟩
292 View
129 Download

Altmetric

Share

Gmail Facebook X LinkedIn More