Home / AIO Classes / MachineLearningTask / Hierarchical Clustering

Hierarchical Clustering

MachineLearningTask AIO:HierarchicalClustering NOT_REVIEWED

A clustering that builds a hierarchy of clusters.

Ontology IRI: https://w3id.org/aio/HierarchicalClustering

Ontology Structure & Relationships

Parent Classes

AIO:Clustering (Clustering)

Branches

MachineLearningTask

Annotations & Sources

Synonyms:

HCL exact

Definition Sources:

https://en.wikipedia.org/wiki/Hierarchical_clustering

Subsets:

https://w3id.org/aio/MachineLearningSubset

Curated AIMech Concepts Grounded to this Class

33 Concepts

Curated Concept	Kind	Mapping Relation	Rationale
Accelerated graph degree linkage `AIMech:AcceleratedGraphDegreeLinkage`	Algorithms	related_match	AGDL repeatedly merges clusters to build an agglomerative hierarchy. The target describes hierarchy construction without prescribing this linkage or candidate-search procedure.
Batch reciprocal-nearest-neighbor agglomeration `AIMech:BatchReciprocalNearestNeighborClustering`	Algorithms	related_match	The batch procedure constructs a hierarchy; the AIO target denotes a clustering task, not this algorithm or a task/algorithm is-a relation.
CHAMELEON clustering `AIMech:CHAMELEONClustering`	Algorithms	related_match	CHAMELEON builds a hierarchy through agglomeration. The target describes hierarchy construction without prescribing this merge criterion or initialization.
Clauset–Newman–Moore community detection `AIMech:CNMCommunityDetection`	Algorithms	related_match	The algorithm constructs an agglomerative hierarchy of vertex groups. The target is a related clustering task, not an equivalent named algorithm or asserted superclass.
CURE clustering `AIMech:CUREClustering`	Algorithms	related_match	CURE repeatedly merges clusters to construct a hierarchy, while the target does not specify its linkage, initialization or stopping rule.
Clique extracted ontology `AIMech:CliXO`	Algorithms	related_match	CliXO constructs an overlapping hierarchy of object sets. The AIO target denotes the related task, not equivalence to a strict tree or an algorithm/task is-a assertion.
Definition-filtered Girvan–Newman community detection `AIMech:DefinitionFilteredGirvanNewman`	Algorithms	related_match	The procedure filters a graph-grouping hierarchy, relating this algorithm to the hierarchical clustering task without asserting equivalence or an algorithm superclass.
Exact PoClustering `AIMech:ExactPoClustering`	Algorithms	related_match	The construction produces a cluster-inclusion partial order that generalizes a tree hierarchy. This maps to the related task, not a tree-equivalence or algorithm/task is-a assertion.
GRINCH clustering `AIMech:GRINCHClustering`	Algorithms	related_match	GRINCH constructs a hierarchy through insertions and reversible subtree placement. The AIO target denotes the task, not this algorithm or an equivalent implementation.
Generic lazy-neighbor agglomerative clustering `AIMech:GenericLazyNeighborAgglomerativeClustering`	Algorithms	related_match	The algorithm constructs an agglomerative hierarchy. The target is a clustering task, so this is a related task context without algorithm/task equivalence or subclass assertion.
Genie clustering `AIMech:GenieClustering`	Algorithms	related_match	The algorithm constructs nested partitions. The AIO target denotes the task, not this inequality-conditioned linkage or an equivalent algorithm.
Girvan–Newman community detection `AIMech:GirvanNewmanCommunityDetection`	Algorithms	related_match	The divisive graph algorithm produces a hierarchy of vertex partitions. This is a relation to the clustering task, not equivalence or an asserted algorithm superclass.
Graph degree linkage `AIMech:GraphDegreeLinkage`	Algorithms	related_match	GDL repeatedly merges clusters to build an agglomerative hierarchy. The target describes hierarchy construction without prescribing this linkage or candidate-search procedure.
HAC-E network clustering `AIMech:HACE`	Algorithms	related_match	This algorithm constructs a hierarchy of vertex groups. The target is a related task, not an equivalent algorithm or asserted superclass.
HAC-ES network clustering `AIMech:HACES`	Algorithms	related_match	This algorithm constructs a hierarchy of vertex groups. The target is a related task, not an equivalent algorithm or asserted superclass.
HAC-ML network clustering `AIMech:HACML`	Algorithms	related_match	The algorithm constructs a hierarchy of object groups. The target is a related task, so this mapping does not assert algorithm/task equivalence or subclass membership.
HAC-Q network clustering `AIMech:HACQ`	Algorithms	related_match	This algorithm constructs a hierarchy of vertex groups. The target is a related task, not an equivalent algorithm or asserted superclass.
HDBSCAN `AIMech:HDBSCAN`	Algorithms	related_match	HierarchicalClustering does not specify density scales and cluster-stability selection. Mapping is local curation, not an upstream subclass assertion.
Joint unsupervised learning of deep representations and image clusters `AIMech:JointUnsupervisedLearning`	Algorithms	related_match	JULE constructs an agglomerative cluster hierarchy while learning the representation. The target is the hierarchy-building task; it does not specify JULE linkage, merge selection or neural updates.
Llama clustering `AIMech:LlamaClustering`	Algorithms	related_match	The method extends nested cluster-tree construction to a structure with overlapping groups and multiple parents. This related-task mapping does not identify its DAG with a tree or assert equivalence to every hierarchical-clustering definition.
NeXO ontology construction `AIMech:NeXOOntologyConstruction`	Algorithms	related_match	The algorithm constructs a hierarchy of object groups. The target is a related task, so this mapping does not assert algorithm/task equivalence or subclass membership.
Nearest-neighbor-chain clustering `AIMech:NearestNeighborChainClustering`	Algorithms	related_match	The procedure builds an agglomerative hierarchy. The pinned target denotes a clustering task; this algorithm is related without asserting task/algorithm equivalence or subclass membership.
Newman greedy modularity algorithm `AIMech:NewmanGreedyModularity`	Algorithms	related_match	The matrix-update algorithm builds an agglomerative hierarchy of graph-vertex groups. The target is a related task rather than an equivalent algorithm or asserted superclass.
Overlapping hierarchical clustering (OHC) `AIMech:OverlappingHierarchicalClustering`	Algorithms	related_match	OHC constructs an overlapping cluster hierarchy; this AIO target denotes the related task, not the specific graph-density algorithm or equivalence to a strict tree.
PERCH clustering `AIMech:PERCHClustering`	Algorithms	related_match	PERCH constructs a hierarchy through online insertions and rotations. The AIO target denotes the task, not this algorithm or an equivalent implementation.
Path integral clustering `AIMech:PathIntegralClustering`	Algorithms	related_match	Path integral clustering repeatedly merges clusters to build an agglomerative hierarchy. The target describes hierarchy construction without prescribing this linkage or candidate-search procedure.
PoClustering edge-clique-cover heuristic `AIMech:PoClusteringEdgeCliqueCover`	Algorithms	related_match	The retained cluster sets form a partial order extending tree-based clustering. The AIO target is a related grouping task rather than an identity with this greedy algorithm.
ROCK clustering `AIMech:ROCKClustering`	Algorithms	related_match	ROCK repeatedly merges clusters to construct a hierarchy, while the target does not specify its linkage, initialization or stopping rule.
Radicchi edge-clustering community detection `AIMech:RadicchiEdgeClustering`	Algorithms	related_match	Successive graph splits produce a grouping hierarchy; the AIO task is related to this particular divisive family rather than equivalent to it.
Reciprocal-nearest-neighbors supported clustering `AIMech:ReciprocalNearestNeighborsSupportedClustering`	Algorithms	related_match	The procedure constructs a hierarchy by recursive representative grouping. The AIO target denotes the task, not this algorithm or an equivalent class.
Sub-Cluster Component clustering `AIMech:SubClusterComponentClustering`	Algorithms	related_match	SCC constructs nested partitions through component agglomeration. This target denotes the task, not this particular algorithm or a task-to-algorithm equivalence.
Ward minimum-variance clustering `AIMech:WardMinimumVarianceClustering`	Algorithms	related_match	The algorithm constructs a hierarchy by greedy ESS-based merges. The pinned target is a clustering task under MachineLearningTask; the relationship does not equate that task with this algorithm or assert subclass membership.
Zeta merging `AIMech:ZetaMerging`	Algorithms	related_match	Zeta merging builds a hierarchy through agglomeration. The target describes hierarchy construction without prescribing this merge criterion or initialization.

Import Provenance & Upstream Synchronization

Source Repo: AIO GitHub

Release Version: aio.json

Commit: 397851c547…

License: CC-BY-4.0

Imported At: 2026-10-10T07:34:10Z

SHA256: 8f741d71408c…

Source File: data/aio/HierarchicalClustering.yaml