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 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.
- Version2.3.1
- R version≥ 3.5
- LicenseGPL-2
- LicenseGPL-3
- Needs compilation?No
- Last release01/30/2024
Team
Cristina Tortora
Noe Vidales
Show author detailsRolesAuthorFrancesco Palumbo
Show author detailsRolesAuthorTina Kalra
Show author detailsRolesAuthorand Paul D. McNicholas
Show author detailsRolesfnd
Insights
Last 30 days
Last 365 days
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Depends3 packages
- Imports8 packages