Ordinal network representation: Representing proximities by graphs

DOI10.1007/BF02296406zbMath0724.92029MaRDI QIDQ2277198

Karl Christoph Klauer

Publication date: 1989

Published in: Psychometrika (Search for Journal in Brave)

zbMATH Keywords

hierarchical clusteringextended similarity treesaddtreesgraph- theoretical representations of proximity dataminimum-path-length distanceordinal network representations

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Applications of graph theory (05C90) Mathematical psychology (91E99)

Related Items

``Minimax length links of a dissimilarity matrix and minimum spanning trees

Cites Work

• Unnamed Item
• A metric and an ordering on sets
• Extended similarity trees
• Spatial, non-spatial and hybrid models for scaling
• Free trees and bidirectional trees as representations of psychological distance
• Hierarchical clustering schemes

This page was built for publication: Ordinal network representation: Representing proximities by graphs