Free trees and bidirectional trees as representations of psychological distance

DOI10.1016/0022-2496(78)90029-9zbMath0383.94041OpenAlexW1993195769MaRDI QIDQ1248492

James P. Cunningham

Publication date: 1978

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

Full work available at URL: https://doi.org/10.1016/0022-2496(78)90029-9

Mathematics Subject Classification ID

Trees (05C05) Applications of mathematical programming (90C90) Applications of graph theory to circuits and networks (94C15) Mathematical psychology (91E99)

Related Items (34)

Extended similarity trees ⋮ Reconstruction of graphs based on random walks ⋮ Underlying graph and total length of optimal realizations of variable distance matrices ⋮ A parametric procedure for ultrametric tree estimation from conditional rank order proximity data ⋮ Graph theoretic foundations of pathfinder networks ⋮ A constructive algorithm for realizing a distance matrix ⋮ Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures ⋮ Exploring the set-theoretical structure of objects by additive trees ⋮ A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees ⋮ Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem ⋮ A note on distance matrices with unicyclic graph realizations ⋮ Asymmetric multidimensional scaling of two-mode three-way proximities ⋮ A probabilistic feature model for unfolding tested for perfect and imperfect nestings ⋮ Monotonic models for asymmetric proximities ⋮ Injective optimal realizations of finite metric spaces ⋮ An algorithm and its role in the study of optimal graph realizations of distance matrices ⋮ A factorization procedure for finite algebras ⋮ Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Level-\(2\) networks from shortest and longest distances ⋮ The additive random feature model for unfolding and the feature structure of choice objects ⋮ Distance spectra of graphs: a survey ⋮ A note on convexity and submatrices of distance matrices ⋮ Reconstructing the shape of a tree from observed dissimilarity data ⋮ Ordinal network representation: Representing proximities by graphs ⋮ The metric cutpoint partition problem ⋮ Tree representations of ternary relations ⋮ A reduction algorithm for approximating a (nonmetric) dissimilarity by a tree distance ⋮ Lattice-based similarity measures between ordered trees ⋮ Trees related to realizations of distance matrices ⋮ Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces ⋮ The representation of three-way proximity data by single and multiple tree structure models ⋮ \(l_\infty\)-approximation via subdominants. ⋮ Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Monotone mapping of similarities into a general metric space
• Spatial, non-spatial and hybrid models for scaling
• Hierarchical clustering schemes
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
• A general nonmetric technique for finding the smallest coordinate space for a configuration of points
• Nonmetric multidimensional scaling. A numerical method
• The distance matrix of a graph and its tree realization
• Unrooted trees for numerical taxonomy
• Distance matrix of a graph and its realizability

This page was built for publication: Free trees and bidirectional trees as representations of psychological distance