Extended similarity trees

DOI10.1007/BF02294065zbMath0603.62070MaRDI QIDQ1082753

Amos Tversky, James E. Corter

Publication date: 1986

Published in: Psychometrika (Search for Journal in Brave)

zbMATH Keywords

proximity dataoverlapping clustersnonhierarchical clusteringadditive treesextended similarity treesEXTREE

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (11)

A user-oriented overview of multiway methods and software ⋮ A parametric procedure for ultrametric tree estimation from conditional rank order proximity data ⋮ 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 ⋮ Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach ⋮ Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem ⋮ Mixtures of (constrained) ultrametric trees ⋮ TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model ⋮ Ordinal network representation: Representing proximities by graphs

Uses Software

• KYST
• ADDTREE/P

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A metric and an ordering on sets
• MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
• Spatial versus tree representations of proximity data
• Free trees and bidirectional trees as representations of psychological distance
• Hierarchical clustering schemes
• Analytic inversion of the five-point Poisson operator

This page was built for publication: Extended similarity trees