Learn R Programming

FPDclustering (version 2.3.5)

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 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.

Copy Link

Version

Install

install.packages('FPDclustering')

Monthly Downloads

538

Version

2.3.5

License

GPL (>= 2)

Maintainer

Cristina Tortora

Last Published

March 6th, 2025

Functions in FPDclustering (2.3.5)

summary.FPDclustering

Summary for FPDclusteringt Objects
PDC

Probabilistic Distance Clustering
PDQ

Probabilistic Distance Clustering Adjusted for Cluster Size
Silh

Probabilistic silhouette plot
Country_data

Unsupervised Learning on Country Data
Star

Star dataset to predict star types
GPDC

Gaussian PD-Clustering
TPDC

Student-t PD-Clustering
TuckerFactors

Choice of the number of Tucker 3 factors for FPDC
asymmetric20

Asymmetric data set shape 20
ais

Australian institute of sport data
plot.FPDclustering

Plots for FPDclustering objects
FPDC

Factor probabilistic distance clustering
print.FPDclustering

Print for FPDclustering objects
Students

Statistics 1 students
asymmetric3

Asymmetric data set shape 3
outliers

Data set with outliers