Hierarchical clustering

Hierarchical Clustering Tutorial
By Kardi Teknomo, PhD.
In this hierarchical clustering tutorial, ...

Hierarchical clustering
A very popular clustering paradigm, that covers several different techniques.
A hierarchy of clusters ...

Divisive Hierarchical Clustering
A top-down clustering method and is less commonly used. It works in a similar way to agglomerative clustering but in the opposite direction.

Hierarchical Clustering Algorithms
How They Work
Given a set of N items to be clustered, and an N*N distance (or similarity) matrix, the basic process of hierarchical clustering (defined by S.C. Johnson in 1967) is this: ...

Hierarchical Clustering
Hierarchical clustering has the advantage over non-hierarchical techniques in that the clusters are defined solely by the data (not by the users predetermining the number of clusters) and that the number of clusters can ...

[edit] Hierarchical clustering
Single-linkage clustering
Conceptual clustering
[edit] Partitional clustering ...

Hierarchical clustering itself can be done in two ways - agglomerative and divisive clustering. In agglomerative clustering, as the name suggests, distinct objects are combined to form a group of objects having some similarities.

K-means and Hierarchical Clustering. K-means is the most famous clustering algorithm.

The clustering algorithms are generally classified as Exclusive Clustering, Overlapping Clustering, Hierarchical Clustering and Probabilistic Clustering.

Johnson, S. C. (1967). Hierarchical clustering schemes. Psychometrika, 32, 241-254.
Johnston, J. (1972). Econometric methods. New York: McGraw-Hill.

See also: Clustering, K-means, Classification, Neural network, Data mining