Metraipolis › archive › dc_0eb8ff445773

Hierarchical clustering — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Hierarchical_clustering
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-07T14:48:45.275Z
SHA-256 of the archived text: de62c00ec6018f4f4f85cef3e353fee5b94a4d962ad6acfa3a1f8225f89b7113
Stable URL of this page: https://metraipolis.com/documento/dc_0eb8ff445773

How to cite

Hierarchical clustering — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Hierarchical_clustering (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_0eb8ff445773 (Metraipolis archive dc_0eb8ff445773, sha256 de62c00ec6018f4f4f85cef3e353fee5b94a4d962ad6acfa3a1f8225f89b7113)

BibTeX

@misc{dc0eb8ff445773,
  title = {Hierarchical clustering — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Hierarchical_clustering},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_0eb8ff445773; sha256 de62c00ec6018f4f4f85cef3e353fee5b94a4d962ad6acfa3a1f8225f89b7113},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Hierarchical_clustering. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In data mining and statistics, hierarchical clustering (also called hierarchical cluster analysis or HCA) is a method of cluster analysis that seeks to build a hierarchy of clusters. Strategies for hierarchical clustering generally fall into two categories: Agglomerative: Agglomerative clustering, often referred to as a "bottom-up" approach, begins with each data point as an individual cluster. At each step, the algorithm merges the two most similar clusters based on a chosen distance metric (e.g., Euclidean distance) and linkage criterion (e.g., single-linkage, complete-linkage). This process continues until all data points are combined into a single cluster or a stopping criterion is met. Agglomerative methods are more commonly used due to their simplicity and computational efficiency for small to medium-sized datasets. Divisive: Divisive clustering, known as a "top-down" approach, starts with all data points in a single cluster and recursively splits the cluster into smaller ones. At each step, the algorithm selects a cluster and divides it into two or more subsets, often using a criterion such as maximizing the distance between resulting clusters. Divisive methods are less common but can be useful when the goal is to identify large, distinct clusters first. In general, the merges and splits are determined in a greedy manner. The results of hierarchical clustering are usually presented in a dendrogram. Hierarchical clustering has the distinct advantage that any valid measure of distance can be used. In fact, the observations themselves are not required: all that is used is a matrix of distances. On the other hand, except for the special case of single-linkage distance, none of the algorithms (except exhaustive search in O ( 2 n ) {\displaystyle {\mathcal {O}}(2^{n})} ) can be guaranteed to find the optimum solution.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «data mining»).
Fonte: Wikipedia in inglese, voce «Hierarchical clustering» — https://en.wikipedia.org/wiki/Hierarchical_clustering
Wikidata Q1277447 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1277447
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Hierarchical_clustering?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1369029920, consultata il 2026-10-07T14:21:55.463Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: fd42e4ba03307712c4d42adc981a9bfc1ff4b16ff1cb6d7abcb6aa17f03e885f