A parametric \(k\)-means algorithm (Q2271693): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Flury / rank | |||
Normal rank |
Revision as of 03:33, 29 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A parametric \(k\)-means algorithm |
scientific article |
Statements
A parametric \(k\)-means algorithm (English)
0 references
8 August 2009
0 references
A technique of principal (self-consistent) point estimation is proposed. It is based on parametric estimation of a distribution and application of a \(k\)-means clustering algorithm to pseudo-data simulated from this estimated distribution. The asymptotic behaviour of this procedure is investigated. A finite mixture of normal distributions is considered as an example. Results of simulations and an application to the problem of determining optimal sizes and shapes of protection masks for men by Swiss army data are considered.
0 references
principal points of distribution
0 references
self-consistent points
0 references
clustering
0 references
finite mixture model
0 references