FPDclustering (Q27351)

From MaRDI portal
Revision as of 17:09, 21 March 2024 by Swh import (talk | contribs) (SWHID from Software Heritage)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
PD-Clustering and Related Methods
Language Label Description Also known as
English
FPDclustering
PD-Clustering and Related Methods

    Statements

    0 references
    0 references
    2.2
    31 August 2022
    0 references
    1.0
    17 December 2014
    0 references
    1.1
    18 May 2016
    0 references
    1.2
    23 August 2017
    0 references
    1.3.1
    22 August 2019
    0 references
    1.3
    12 April 2019
    0 references
    1.4.1
    28 January 2020
    0 references
    1.4
    9 January 2020
    0 references
    2.0
    11 September 2021
    0 references
    2.1
    2 February 2022
    0 references
    2.3
    25 January 2024
    0 references
    2.3.1
    30 January 2024
    0 references
    0 references
    30 January 2024
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references