FPDclustering (Q27351): Difference between revisions
From MaRDI portal
Changed an Item |
Swh import (talk | contribs) SWHID from Software Heritage |
||||||||||||||
(2 intermediate revisions by 2 users not shown) | |||||||||||||||
Property / source code repository | |||||||||||||||
Property / source code repository: https://github.com/cran/FPDclustering / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Software Heritage ID | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:aca231bf1f645760f28678f60469166f7c784a9c / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:aca231bf1f645760f28678f60469166f7c784a9c / qualifier | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:aca231bf1f645760f28678f60469166f7c784a9c / qualifier | |||||||||||||||
point in time: 10 February 2024
| |||||||||||||||
links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 16:09, 21 March 2024
PD-Clustering and Related Methods
Language | Label | Description | Also known as |
---|---|---|---|
English | FPDclustering |
PD-Clustering and Related Methods |
Statements
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
expanded from: GPL (≥ 2) (English)
0 references