63 citations · 64 across the 3 of their papers we have counts for
3 papers
Sparsity-aware Possibilistic Clustering Algorithms
Spyridoula D. Xenaki, Konstantinos D. Koutroumbas, Athanasios A. Rontogiannis
In this paper two novel possibilistic clustering algorithms are presented, which utilize the concept of sparsity. The first one, called sparse possibilistic c-means, exploits spars…
On the convergence of the sparse possibilistic c-means algorithm
Spyridoula D. Xenaki, Konstantinos D. Koutroumbas, Athanasios A. Rontogiannis
In this paper, a convergence proof for the recently proposed sparse possibilistic c-means (SPCM) algorithm is provided, utilizing the celebrated Zangwill convergence theorem. It is…
A Novel Adaptive Possibilistic Clustering Algorithm
Spyridoula D. Xenaki, Konstantinos D. Koutroumbas, Athanasios A. Rontogiannis
In this paper a novel possibilistic c-means clustering algorithm, called Adaptive Possibilistic c-means, is presented. Its main feature is that {\it all} its parameters, after thei…