FPDclustering
swMATH15462CRANFPDclusteringMaRDI QIDQ27351
PD-Clustering and Related Methods
Cristina Tortora, Noe Vidales, Francesco Palumbo, Tina Kalra
Last update: 30 January 2024
Software version identifier: 2.2, 1.0, 1.1, 1.2, 1.3.1, 1.3, 1.4.1, 1.4, 2.0, 2.1, 2.3, 2.3.1
Source code repository: https://github.com/cran/FPDclustering
Copyright license: GNU General Public License, version 3.0, GNU General Public License, version 2.0
Probabilistic distance clustering (PD-clustering) is an iterative, distribution free, probabilistic clustering method. PD-clustering assigns units to a cluster according to their probability of membership, under the constraint that the product of the probability and the distance of each point to any cluster centre is a constant. PD-clustering is a flexible method that can be used with non-spherical clusters, outliers, or noisy data. PDQ is an extension of the algorithm for clusters of different size. GPDC and TPDC uses a dissimilarity measure based on densities. Factor PD-clustering (FPDC) is a factor clustering method that involves a linear transformation of variables and a cluster optimizing the PD-clustering criterion. It works on high dimensional data sets.
