Learn R Programming

FPDclustering (version 2.3.1)

PD-Clustering and Related Methods

Description

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.

Copy Link

Version

Install

install.packages('FPDclustering')

Monthly Downloads

349

Version

2.3.1

License

GPL (>= 2)

Last Published

January 30th, 2024

Functions in FPDclustering (2.3.1)

PDC

Probabilistic Distance Clustering
Students

Statistics 1 students
ais

Australian institute of sport data
asymmetric3

Asymmetric data set shape 3
asymmetric20

Asymmetric data set shape 20
PDQ

Probabilistic Distance Clustering Adjusted for Cluster Size
outliers

Data set with outliers
TPDC

Student-t PD-Clustering
Country_data

Unsupervised Learning on Country Data
Silh

Probabilistic silhouette plot
TuckerFactors

Choice of the number of Tucker 3 factors for FPDC
FPDC

Factor probabilistic distance clustering
plot.FPDclustering

Plots for FPDclusteringt Objects
summary.FPDclustering

Summary for FPDclusteringt Objects
GPDC

Gaussian PD-Clustering
Star

Star dataset to predict star types