Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects

DOI10.1016/0025-5564(76)90047-XzbMath0334.92042OpenAlexW2048420014MaRDI QIDQ1229180

L. P. Lefkovitch

Publication date: 1976

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(76)90047-x

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Mathematical psychology (91E99) Applications of statistics to psychology (62P15)

Related Items

Clustering from ordination ⋮ Conditional clusters, musters, and probability ⋮ Euclidean consensus dendrograms and other classification structures ⋮ Vector dissimilarity and clustering

Cites Work

• A molecular sequence metric and evolutionary trees
• Singular value decomposition and least squares solutions
• An Axiomatic Specification of Euclidean Analysis
• Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
• Some distance properties of latent root and vector methods used in multivariate analysis
• An Analysis of Some Graph Theoretical Cluster Techniques
• Admissible clustering procedures
• Computational Variants of the Lanczos Method for the Eigenproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item