Extended similarity trees (Q1082753): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: KYST / rank | |||
Normal rank | |||
Revision as of 18:51, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extended similarity trees |
scientific article |
Statements
Extended similarity trees (English)
0 references
1986
0 references
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.
0 references
extended similarity trees
0 references
nonhierarchical clustering
0 references
additive trees
0 references
overlapping clusters
0 references
EXTREE
0 references
proximity data
0 references
