GEVA: geometric variability-based approaches for identifying patterns in data
Four new general approaches to clustering based on geometric variability (GEVA) are presented. One algorithm is for partitioning a group into \(k\) subgroups, for some specified \(k>1\). The other three algorithms are agglomerative. GEVA-clustering algorithms require only a distance between individuals and can be applied to general studies involving binary, ordinal and countable data. Properties of GEVA clustering procedures are observed. The GEVA approaches are illustrated using hypothetical and real data on Drosophila chromosomal inversions. It is shown that for Drosophila subobscura the results are better than those obtained by standard hierarchical clustering.
- A continuous metric scaling solution for a random variable
- Analysis of Distance for Structured Multivariate Data and Extensions to Multivariate Analysis of Variance
- Biplots for Multifactorial Analysis of Distance
- Generalized discriminant analysis based on distances
- scientific article; zbMATH DE number 3936273 (Why is no real title available?)
- scientific article; zbMATH DE number 3429948 (Why is no real title available?)
- scientific article; zbMATH DE number 3103176 (Why is no real title available?)
- Metric and Euclidean properties of dissimilarity coefficients
- Probability distributions with given multivariate marginals and given dependence structure
- Some boundary conditions for a monotone analysis of symmetric matrices
- Some distance properties of latent root and vector methods used in multivariate analysis
- The proximity of an individual to a population with applications in discriminant analysis
This page was built for publication: GEVA: geometric variability-based approaches for identifying patterns in data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2430241)