Dynamic clustering for interval data based on \(L_2\) distance (Q880907)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Dynamic clustering for interval data based on Lā distance |
scientific article; zbMATH DE number 5158598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dynamic clustering for interval data based on \(L_2\) distance |
scientific article; zbMATH DE number 5158598 |
Statements
Dynamic clustering for interval data based on \(L_2\) distance (English)
0 references
29 May 2007
0 references
The authors consider a \(k\)-clustering dynamic algorithm for clusterization of multidimensional intervals. It is based on the Minkowski-like \(L_2\)-type distance. Three types of variables standardization are considered, they are based on the dispersion of interval centres, dispersion of interval boundaries and the global range. Heterogeneity measures based on sums of squares are discussed. Results of simulations and application to car data are presented.
0 references
dynamic \(k\)-clustering
0 references
Minkowski distance
0 references
symbolic data
0 references
0 references
