Divisive Hierarchical Clustering Algorithm

Revision as of 19:32, 19 May 2019 by Gmelliapi (talk | contribs) (Created page with " A Divisive Hierarchical Clustering Algorithm is a [[]] that ... * <B>AKA:</B> Hierarchical Clustering, Divisive Clustering. * <B>See:</B> . ---- ---- ==Refe...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

A Divisive Hierarchical Clustering Algorithm is a [[]] that ...



References

2019

  • (Wikipedia, 2019) ⇒ https://en.wikipedia.org/wiki/Hierarchical_clustering#Divisive_clustering Retrieved:2019-5-19.
    • The basic principle of divisive clustering was published as the DIANA (DIvisive ANAlysis Clustering) algorithm. [1] Initially, all data is in the same cluster, and the largest cluster is split until every object is separate.

      Because there exist [math]\displaystyle{ O(2^n) }[/math] ways of splitting each cluster, heuristics are needed. DIANA chooses the object with the maximum average dissimilarity and then moves all objects to this cluster that are more similar to the new cluster than to the remainder.

  1. Kaufman, L., & Roussew, P. J. (1990). Finding Groups in Data - An Introduction to Cluster Analysis. A Wiley-Science Publication John Wiley & Sons.