CRAN/E | FPDclustering

FPDclustering

PD-Clustering and Related Methods

Installation

About

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.

Key Metrics

Version 2.3.1
R ≥ 3.5
Published 2024-01-30 86 days ago
Needs compilation? no
License GPL-2
License GPL-3
CRAN checks FPDclustering results

Downloads

Yesterday 31 +288%
Last 7 days 91 +8%
Last 30 days 327 -2%
Last 90 days 1.192 +5%
Last 365 days 4.024 -14%

Maintainer

Maintainer

Cristina Tortora

grikris1@gmail.com

Authors

Cristina Tortora

aut / cre / cph

Noe Vidales

aut

Francesco Palumbo

aut

Tina Kalra

aut

Paul D. McNicholas

fnd

Material

Reference manual
Package source

macOS

r-release

arm64

r-oldrel

arm64

r-release

x86_64

Windows

r-devel

x86_64

r-release

x86_64

r-oldrel

x86_64

Old Sources

FPDclustering archive

Depends

ThreeWay
mvtnorm
R ≥ 3.5

Imports

ExPosition
cluster
rootSolve
MASS
klaR
GGally
ggplot2
ggeasy