Extended Similarity Trees
- 1 September 1986
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 51 (3) , 429-451
- https://doi.org/10.1007/bf02294065
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- ADDTREE/P: A PASCAL program for fitting additive trees based on Sattath and Tversky’s ADDTREE algorithmBehavior Research Methods, 1982
- Spatial Versus Tree Representations of Proximity DataPsychometrika, 1982
- Recognition models of alphanumeric charactersPerception & Psychophysics, 1981
- MACPLUS: A Mathematical Programming Approach to Fitting the ADCLUS ModelPsychometrika, 1980
- Free trees and bidirectional trees as representations of psychological distanceJournal of Mathematical Psychology, 1978
- Additive Similarity TreesPsychometrika, 1977
- Family resemblances: Studies in the internal structure of categoriesCognitive Psychology, 1975
- The Use of Faces to Represent Points in k-Dimensional Space GraphicallyJournal of the American Statistical Association, 1973
- Hierarchical clustering schemesPsychometrika, 1967
- A Metric and an Ordering on SetsPsychometrika, 1959