On a new naturally indexed quick clustering method with a global objective function

Jan W. Owsiński

Applied Stochastic Models and Data Analysis, 1990, vol. 6, issue 3, 157-171

Abstract: A new clustering method is presented which proposes a class of objective functions and an algorithm which sub‐optimizes the objective functions over the whole space of partitions. The objective functions have a global nature, encompassing both the cluster contents and the cluster number. However, the accompanying suboptimization algorithm works according to a simple progressive merger scheme. The algorithmic scheme produces in a quite natural way an indexed hierarchy. The hierarchy index is not just tacked on to the method—see Diday and Moreau1—on the contrary, the algorithm refers directly to its values which measure, depending upon the particular formulation, either the relative affinity or the relative difference of the two clusters merged at a given level of hierarchy. In this way, the scale of hierarchy and hierarchy‐wise validity of clusters can easily be established, which is of great importance in analysing unstructured data sets whose generating process is unknown and can only be hypothesized after an initial structure had been established, e.g. owing to clustering, as is the case in pattern recognition—see Kaminuma2.

Date: 1990
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asm.3150060303

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:apsmda:v:6:y:1990:i:3:p:157-171

Access Statistics for this article

More articles in Applied Stochastic Models and Data Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().