A Probabilistic Distance Clustering Algorithm Using Gaussian and Student-t Multivariate Density Distributions
SN Computer Science
A new dissimilarity measure for cluster analysis is presented and used in the context of probabilistic distance (PD) clustering. The basic assumption of PD-clustering is that for each unit, the product between the probability of the unit belonging to a cluster and the distance between the unit and the cluster is constant. This constant is a measure of the classifiability of the point, and the sum of the constant over units is called joint distance function (JDF). The parameters that minimize the JDF maximize the classifiability of the units. The new dissimilarity measure is based on the use of symmetric density functions and allows the method to find clusters characterized by different variances and correlation among variables. The multivariate Gaussian and the multivariate Student-t distributions have been used, outperforming classical PD clustering, and its variation PD clustering adjusted for cluster size, on simulated and real datasets.
Università degli Studi di Napoli Federico II
Cluster analysis, Dissimilarity measures, Multivariate distributions, PD-clustering
Mathematics and Statistics
Cristina Tortora, Paul D. McNicholas, and Francesco Palumbo. "A Probabilistic Distance Clustering Algorithm Using Gaussian and Student-t Multivariate Density Distributions" SN Computer Science (2020). https://doi.org/10.1007/s42979-020-0067-z