Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects
type: Item
instance of: scholarly article
title: Hierarchical clustering from principal coordinates: An efficient method for small to very large numbers of objects
zbMATH Open document ID: 0334.92042
DOI: 10.1016/0025-5564(76)90047-X
author: L. P. Lefkovitch
published in: Mathematical Biosciences
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 91E99
Mathematics Subject Classification ID: 62H25
Mathematics Subject Classification ID: 62P15
zbMATH DE Number: 3523387
MaRDI profile type: Publication
cites work: An Analysis of Some Graph Theoretical Cluster Techniques
cites work: A molecular sequence metric and evolutionary trees
cites work: Q5512461
cites work: Admissible clustering procedures
cites work: Singular value decomposition and least squares solutions
cites work: Some distance properties of latent root and vector methods used in multivariate analysis
cites work: Q4057430
cites work: Q4039929
cites work: Q4085109
cites work: Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
cites work: Computational Variants of the Lanczos Method for the Eigenproblem
cites work: Q4189103
cites work: An Axiomatic Specification of Euclidean Analysis
full work available at URL: 0025-5564(76)90047-x
OpenAlex ID: W2048420014
description: scientific article; zbMATH DE number 3523387