Extended similarity trees

DOI10.1007/BF02294065MaRDI QIDQ1082753zbMATH OpenFDO

Authors James E. Corter, Amos Tversky

Publication date 1986

Published in Psychometrika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02294065

zbMATH Keywords

additive treesextended similarity treesEXTREEnonhierarchical clusteringoverlapping clustersproximity data

Mathematics Subject Classification ID

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

Review text

Proximity data can be represented by an extended tree, which generalizes traditional trees by including marked segments that correspond to overlapping clusters. An extended tree is a graphical representation of the distinctive features model. A computer program (EXTREE) that constructs extended trees is described and applied to several sets of conceptual and perceptual proximity data.

Recommendations

• scientific article; zbMATH DE number 1113988
• scientific article; zbMATH DE number 5274833
• scientific article; zbMATH DE number 4145711
• The representation of three-way proximity data by single and multiple tree structure models
• scientific article; zbMATH DE number 1131221

Cites work

• A metric and an ordering on sets
• Analytic inversion of the five-point Poisson operator
• Free trees and bidirectional trees as representations of psychological distance
• Hierarchical clustering schemes
• scientific article; zbMATH DE number 3829059 (Why is no real title available?)
• scientific article; zbMATH DE number 3504320 (Why is no real title available?)
• scientific article; zbMATH DE number 3448387 (Why is no real title available?)
• MAPCLUS: A mathematical programming approach to fitting the ADCLUS model
• Spatial versus tree representations of proximity data

Cited in

(13)

• TSCALE: A new multidimensional scaling procedure based on Tversky's contrast model
• Pairwise partitioning: A nonmetric algorithm for identifying feature-based similarity structures
• Exploring the set-theoretical structure of objects by additive trees
• Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem
• A user-oriented overview of multiway methods and software
• A parametric procedure for ultrametric tree estimation from conditional rank order proximity data
• A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
• Mixtures of (constrained) ultrametric trees
• Ordinal network representation: Representing proximities by graphs
• Latent Features in Similarity Judgments: A Nonparametric Bayesian Approach
• scientific article; zbMATH DE number 1113988 (Why is no real title available?)
• Variations on a tree
• A constructive algorithm for realizing a distance matrix

Describes a project that uses

Uses Software

• ADDTREE/P
• KYST

This page was built for publication: Extended similarity trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082753)