Crandore Hub

FPDclustering

PD-Clustering and Related Methods

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 center is a constant. PD-clustering is a flexible method that can be used with elliptical clusters, outliers, or noisy data. PDQ is an extension of the algorithm for clusters of different sizes. GPDC and TPDC use 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.

Versions across snapshots

VersionRepositoryFileSize
2.3.5 rolling source/ R- FPDclustering_2.3.5.tar.gz 1.9 MiB
2.3.5 latest source/ R- FPDclustering_2.3.5.tar.gz 1.9 MiB
2.3.5 2026-04-23 source/ R- FPDclustering_2.3.5.tar.gz 1.9 MiB
2.3.5 2026-04-09 windows/windows R-4.5 FPDclustering_2.3.5.zip 2.0 MiB

Dependencies (latest)

Depends

Imports