z-logo
Premium
A METHOD OF CLUSTER ANALYSIS
Author(s) -
Constantinescu Paul
Publication year - 1967
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.1967.tb00381.x
Subject(s) - cluster analysis , tree (set theory) , mathematics , set (abstract data type) , representation (politics) , graph , computation , cluster (spacecraft) , computer science , theoretical computer science , data mining , algorithm , combinatorics , statistics , politics , political science , law , programming language
A mathematical method is proposed for clustering a set of elements with respect to a set of criteria. Input information is described in terms of a graph representing a distance function between the elements. Definitions are given for the concepts of a ‘tree’, and a ‘tree‐representation’. It is shown that clusters are particular kinds of subsets (level‐subsets) in a tree‐representation; and that a final pattern contains at least one non‐trivial tree, under specified conditions. An example of clustering is set out, and the computation of level‐subsets is described. The selection of clusters from a final pattern is briefly discussed.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here