Hierarchical clustering

Pedro Contreras, Fionn Murtagh

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

To begin with, we review dissimilarity, metric, and ultrametric. Next, we introduce hierarchical clustering using the single link agglomerative criterion. Then we present agglomerative hierarchical clustering in full generality. Storage and computational properties are reviewed. This includes the state-of-the art agglomerative hierarchical clustering algorithm that uses a nearest-neighbor chain and reciprocal nearest neighbors. We then review various, recently developed, hierarchical clustering algorithms that use density or grid-based approaches. That includes a linear time algorithm. A number of examples, and R implementation, completes this chapter.

LanguageEnglish
Title of host publicationHandbook of Cluster Analysis
EditorsChristian Hennig, Marina Meila, Fionn Murtagh, Roberto Rocci
PublisherCRC Press
Pages103-124
Number of pages22
ISBN (Electronic)9781466551893
ISBN (Print)9781466551886
DOIs
Publication statusPublished - 1 Dec 2015
Externally publishedYes

Fingerprint

Hierarchical Clustering
Clustering algorithms
Clustering Algorithm
Nearest Neighbor
Dissimilarity
Linear-time Algorithm
Grid
Metric
Hierarchical clustering
Review
Clustering algorithm
Nearest neighbor

Cite this

Contreras, P., & Murtagh, F. (2015). Hierarchical clustering. In C. Hennig, M. Meila, F. Murtagh, & R. Rocci (Eds.), Handbook of Cluster Analysis (pp. 103-124). CRC Press. https://doi.org/10.1201/b19706
Contreras, Pedro ; Murtagh, Fionn. / Hierarchical clustering. Handbook of Cluster Analysis. editor / Christian Hennig ; Marina Meila ; Fionn Murtagh ; Roberto Rocci. CRC Press, 2015. pp. 103-124
@inbook{c3a6902508c14bd18aa301421abf3a65,
title = "Hierarchical clustering",
abstract = "To begin with, we review dissimilarity, metric, and ultrametric. Next, we introduce hierarchical clustering using the single link agglomerative criterion. Then we present agglomerative hierarchical clustering in full generality. Storage and computational properties are reviewed. This includes the state-of-the art agglomerative hierarchical clustering algorithm that uses a nearest-neighbor chain and reciprocal nearest neighbors. We then review various, recently developed, hierarchical clustering algorithms that use density or grid-based approaches. That includes a linear time algorithm. A number of examples, and R implementation, completes this chapter.",
author = "Pedro Contreras and Fionn Murtagh",
year = "2015",
month = "12",
day = "1",
doi = "10.1201/b19706",
language = "English",
isbn = "9781466551886",
pages = "103--124",
editor = "Christian Hennig and Marina Meila and Fionn Murtagh and Roberto Rocci",
booktitle = "Handbook of Cluster Analysis",
publisher = "CRC Press",

}

Contreras, P & Murtagh, F 2015, Hierarchical clustering. in C Hennig, M Meila, F Murtagh & R Rocci (eds), Handbook of Cluster Analysis. CRC Press, pp. 103-124. https://doi.org/10.1201/b19706

Hierarchical clustering. / Contreras, Pedro; Murtagh, Fionn.

Handbook of Cluster Analysis. ed. / Christian Hennig; Marina Meila; Fionn Murtagh; Roberto Rocci. CRC Press, 2015. p. 103-124.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Hierarchical clustering

AU - Contreras, Pedro

AU - Murtagh, Fionn

PY - 2015/12/1

Y1 - 2015/12/1

N2 - To begin with, we review dissimilarity, metric, and ultrametric. Next, we introduce hierarchical clustering using the single link agglomerative criterion. Then we present agglomerative hierarchical clustering in full generality. Storage and computational properties are reviewed. This includes the state-of-the art agglomerative hierarchical clustering algorithm that uses a nearest-neighbor chain and reciprocal nearest neighbors. We then review various, recently developed, hierarchical clustering algorithms that use density or grid-based approaches. That includes a linear time algorithm. A number of examples, and R implementation, completes this chapter.

AB - To begin with, we review dissimilarity, metric, and ultrametric. Next, we introduce hierarchical clustering using the single link agglomerative criterion. Then we present agglomerative hierarchical clustering in full generality. Storage and computational properties are reviewed. This includes the state-of-the art agglomerative hierarchical clustering algorithm that uses a nearest-neighbor chain and reciprocal nearest neighbors. We then review various, recently developed, hierarchical clustering algorithms that use density or grid-based approaches. That includes a linear time algorithm. A number of examples, and R implementation, completes this chapter.

UR - http://www.scopus.com/inward/record.url?scp=85046057289&partnerID=8YFLogxK

U2 - 10.1201/b19706

DO - 10.1201/b19706

M3 - Chapter

SN - 9781466551886

SP - 103

EP - 124

BT - Handbook of Cluster Analysis

A2 - Hennig, Christian

A2 - Meila, Marina

A2 - Murtagh, Fionn

A2 - Rocci, Roberto

PB - CRC Press

ER -

Contreras P, Murtagh F. Hierarchical clustering. In Hennig C, Meila M, Murtagh F, Rocci R, editors, Handbook of Cluster Analysis. CRC Press. 2015. p. 103-124 https://doi.org/10.1201/b19706