Published on Thu Oct 15 2015

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 exploits sparsity and can deal well with closely located clusters. The second one is an extension of the first one, where now the involved parameters are dynamically adapted.

0
0
0
Abstract

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 sparsity and can deal well with closely located clusters that may also be of significantly different densities. The second one, called sparse adaptive possibilistic c-means, is an extension of the first, where now the involved parameters are dynamically adapted. The latter can deal well with even more challenging cases, where, in addition to the above, clusters may be of significantly different variances. More specifically, it provides improved estimates of the cluster representatives, while, in addition, it has the ability to estimate the actual number of clusters, given an overestimate of it. Extensive experimental results on both synthetic and real data sets support the previous statements.

Thu Dec 11 2014
Computer Vision
A Novel Adaptive Possibilistic Clustering Algorithm
The proposed algorithm enables the removal of the clusters that gradually become obsolete. Theoretical results that are indicative of the convergence behavior of the algorithm are also provided. Finally, extensive simulations highlight the effectiveness of the proposed algorithm.
0
0
0
Thu Oct 27 2016
Machine Learning
PCM and APCM Revisited: An Uncertainty Perspective
In this paper, we take a new look at the possibilistic c-means (PCM) and adaptive PCM (APCM) clustering algorithms from the perspective of uncertainty. We analyze the clustering behavior of PCM-based algorithms and introduce parameters $\
0
0
0
Wed Aug 05 2015
Computer Vision
On the convergence of the sparse possibilistic c-means algorithm
A paper provides a convergence proof for the recently proposed sparse possibilistic c-means (SPCM) algorithm. It is shown that the iterative sequence generated by SPCM converges to a stationary point.
0
0
0
Fri Jan 10 2020
Machine Learning
Probabilistic K-means Clustering via Nonlinear Programming
K-means is a classical clustering algorithm with wide applications. It remains unsolved since 1981. We propose a novel clustering model, i.e. Probabilistic K-Means (PKM)
0
0
0
Thu Jun 13 2013
Machine Learning
Non-parametric Power-law Data Clustering
Pitman-Yor Process based k-means is proposed in this paper. It treats clusters differently by dynamically and adaptively changing the threshold. One center agglomeration procedure is integrated into the implementation to be able to merge small but close clusters.
0
0
0
Wed Feb 08 2017
Machine Learning
Clustering For Point Pattern Data
Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. The first is a non-parametric method based on novel distances for sets. The second is a model-based approach, formulated via random finite set theory.
0
0
0