Lattice-based similarity measures between ordered trees

DOI10.1016/0022-2496(82)90049-9zbMath0511.62118OpenAlexW1973991881MaRDI QIDQ1838813

Stephen C. Hirtle

Publication date: 1982

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/23962

zbMATH Keywords

clusteringordered treeslattice-based similarity measureslong- term memory structuresrecall orders

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Trees (05C05) Structure theory of lattices (06B05) Modular lattices, Desarguesian lattices (06C05) Mathematical psychology (91E99) Applications of statistics to psychology (62P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Metrics on spaces of finite trees
• The complexity of computing metric distances between partitions
• Spatial, non-spatial and hybrid models for scaling
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Free trees and bidirectional trees as representations of psychological distance
• Parallel concepts in graph theory
• Hierarchical clustering schemes
• Multidimensional scaling of measures of distance between partitions
• Printer graphics for clustering

This page was built for publication: Lattice-based similarity measures between ordered trees