Premium
Tree structures for proximity data
Author(s) -
Colonius H.,
Schulze H. H.
Publication year - 1981
Publication title -
british journal of mathematical and statistical psychology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.157
H-Index - 51
eISSN - 2044-8317
pISSN - 0007-1102
DOI - 10.1111/j.2044-8317.1981.tb00626.x
Subject(s) - tree (set theory) , representation (politics) , mathematics , index (typography) , tree structure , data structure , data mining , statistics , computer science , algorithm , theoretical computer science , combinatorics , binary tree , politics , world wide web , political science , law , programming language
Previous work on representing proximity data by tree structures is reviewed. The authors then present two paradigms for data collection and develop appropriate measurement structures for non‐numerical data. Two theorems on representing these data by rooted or unrooted trees are given and their relationship to the more conventional representation by a dissimilarity index is discussed.