Home / AIO Classes / MachineLearningTask / Unsupervised Clustering

Unsupervised Clustering

MachineLearningTask AIO:UnsupervisedClustering NOT_REVIEWED

A clustering focused on methods that group a set of unlabeled objects such that objects in the same group are more similar to each other than to those in other groups.

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

Ontology Structure & Relationships

Parent Classes

AIO:Clustering (Clustering)

Branches

MachineLearningTask

Annotations & Sources

Synonyms:

Unsupervised Cluster Analysis exact

Definition Sources:

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

Subsets:

https://w3id.org/aio/MachineLearningSubset

Curated AIMech Concepts Grounded to this Class

62 Concepts

Curated Concept	Kind	Mapping Relation	Rationale
Accelerated graph degree linkage `AIMech:AcceleratedGraphDegreeLinkage`	Algorithms	related_match	AGDL groups unlabeled observations using a specified graph-based merge procedure. The AIO target is a clustering task, so this algorithm-to-task association does not assert equivalence or an is-a relation.
Batch reciprocal-nearest-neighbor agglomeration `AIMech:BatchReciprocalNearestNeighborClustering`	Algorithms	related_match	Clusters are formed from supplied dissimilarities without known class labels. The task target does not specify reciprocal batches, linkages or tie conventions.
Binary Multiple Kernel Maximum Margin Clustering `AIMech:BinaryMultipleKernelMaximumMarginClustering`	Algorithms	related_match	The inspected procedure performs unlabeled clustering; the AIO target is the related task, not an equivalent algorithm identity or asserted superclass. In this pin SupportVectorMachine is scoped as a supervised classification/regression network, and BinaryClassification and MulticlassClassification inherit supervised task scope. Shared margin terminology does not establish those identities.
CHAMELEON clustering `AIMech:CHAMELEONClustering`	Algorithms	related_match	CHAMELEON supplies a procedure for grouping unlabeled observations. The AIO target denotes a clustering task; this algorithm-to-task association does not assert equivalence or subclass membership.
CLARANS clustering `AIMech:CLARANSClustering`	Algorithms	related_match	CLARANS is a specified medoid-search procedure for grouping unlabeled observations. The AIO target is a clustering task; this method-to-task relation is not equivalence or subclass membership.
Clauset–Newman–Moore community detection `AIMech:CNMCommunityDetection`	Algorithms	related_match	Graph topology and a prescribed objective determine the groups rather than supervised class labels. This task relation preserves the algorithm/task distinction.
CURE clustering `AIMech:CUREClustering`	Algorithms	related_match	CURE groups unlabeled observations using a specified agglomerative procedure. The AIO target is a task; this association does not assert algorithm/task equivalence or subclass membership.
Classification Annealing Expectation Maximization `AIMech:ClassificationAnnealingExpectationMaximization`	Algorithms	related_match	The defining procedure estimates a hard grouping of unlabeled observations alongside fitted component parameters. The pinned target is a clustering task, so the algorithm is related without an is-a assertion. The word classification in the historical name does not identify the explicitly supervised AIO:Classification class.
Classification Expectation Maximization `AIMech:ClassificationExpectationMaximization`	Algorithms	related_match	The defining procedure estimates a hard grouping of unlabeled observations alongside fitted component parameters. The pinned target is a clustering task, so the algorithm is related without an is-a assertion. The word classification in the historical name does not identify the explicitly supervised AIO:Classification class.
Clique extracted ontology `AIMech:CliXO`	Algorithms	related_match	The algorithm groups objects from supplied pairwise relationships. GO-based evaluation and optional domain-informed parameter tuning do not make its generic construction a supervised classifier.
Clustering Data by Melting `AIMech:ClusteringDataByMelting`	Algorithms	related_match	The method constructs and selects clusters from unlabeled points. The inspected target denotes an unsupervised clustering process/task; this related match preserves the algorithm-versus-task distinction without asserting equivalence or an upstream subclass.
Global Kernel K-Means with Convex Mixture Models `AIMech:ConvexMixtureInitializedGlobalKernelKMeans`	Algorithms	related_match	This fixed-kernel clustering algorithm performs the inspected unlabeled clustering task. The relation does not equate algorithm and task or assert an upstream subclass. KernelLayer, PCA, neural graph models and a nested cluster hierarchy have different scopes.
Cutting Plane Multiclass Maximum Margin Clustering `AIMech:CuttingPlaneMulticlassMaximumMarginClustering`	Algorithms	related_match	CPM3C groups unlabeled observations through latent multiclass margins, so UnsupervisedClustering is the related task. The algorithm is not an equivalent supervised multiclass classification task or supervised SVM network, and its kernel coordinates do not identify it with PCA. No upstream subclass is asserted.
DeepCluster `AIMech:DeepCluster`	Algorithms	related_match	This procedure uses or directly learns unlabeled image cluster assignments. The pinned target is an unlabeled clustering task; this is a related algorithm-to-task association, not equivalence, a semantic class-label guarantee or an is-a assertion.
Deep continuous clustering `AIMech:DeepContinuousClustering`	Algorithms	related_match	DCC learns groups from unlabeled observations. The AIO target is the task, while this local record specifies the joint representation-and-clustering algorithm; no equivalence or subclass assertion is made.
Deep embedded clustering `AIMech:DeepEmbeddedClustering`	Algorithms	related_match	The algorithm learns assignments for an unlabeled clustering task. The AIO target is a task; this is an algorithm-to-task association, not equivalence or an is-a assertion.
Definition-filtered Girvan–Newman community detection `AIMech:DefinitionFilteredGirvanNewman`	Algorithms	related_match	Groups and acceptance tests use graph topology without training labels; external labels in evaluation do not turn this into supervised classification.
Exact PoClustering `AIMech:ExactPoClustering`	Algorithms	related_match	The generic construction groups objects from supplied pairwise dissimilarities; annotation-derived evaluation inputs do not make its identity a supervised classifier.
Exemplar-Based Convex Clustering `AIMech:ExemplarBasedConvexClustering`	Algorithms	related_match	The procedure fits exemplar weights and constructs a grouping from unlabeled observations. The inspected AIO target is a clustering task; this algorithm-to-task association asserts neither equivalence nor an upstream subclass.
Fast Global Kernel K-Means `AIMech:FastGlobalKernelKMeans`	Algorithms	related_match	This fixed-kernel clustering algorithm performs the inspected unlabeled clustering task. The relation does not equate algorithm and task or assert an upstream subclass. KernelLayer, PCA, neural graph models and a nested cluster hierarchy have different scopes.
GRINCH clustering `AIMech:GRINCHClustering`	Algorithms	related_match	The construction groups observations using supplied linkage scores. Reference labels assess quality; learning a linkage in a separate supervised application does not make the generic grouping algorithm a classifier.
Generic lazy-neighbor agglomerative clustering `AIMech:GenericLazyNeighborAgglomerativeClustering`	Algorithms	related_match	The method groups unlabeled observations under supplied dissimilarities and a linkage update. The task target does not specify cached row bounds or deferred rescans.
Genie clustering `AIMech:GenieClustering`	Algorithms	related_match	Merge selection uses distances and cluster sizes without reference labels. Benchmark labels determine evaluation cuts, which is separate from the merge rule.
Girvan–Newman community detection `AIMech:GirvanNewmanCommunityDetection`	Algorithms	related_match	The edge-removal rule derives groups from graph topology without class-label supervision. External labels are used in evaluation rather than to define the removal rule.
Global Kernel K-Means `AIMech:GlobalKernelKMeans`	Algorithms	related_match	This fixed-kernel clustering algorithm performs the inspected unlabeled clustering task. The relation does not equate algorithm and task or assert an upstream subclass. KernelLayer, PCA, neural graph models and a nested cluster hierarchy have different scopes.
Graph degree linkage `AIMech:GraphDegreeLinkage`	Algorithms	related_match	GDL groups unlabeled observations using a specified graph-based merge procedure. The AIO target is a clustering task, so this algorithm-to-task association does not assert equivalence or an is-a relation.
HAC-E network clustering `AIMech:HACE`	Algorithms	related_match	The procedure groups graph vertices using observed relationships rather than supervised label prediction. The task relation does not establish algorithm identity.
HAC-ES network clustering `AIMech:HACES`	Algorithms	related_match	The procedure groups graph vertices using observed relationships rather than supervised label prediction. The task relation does not establish algorithm identity.
HAC-ML network clustering `AIMech:HACML`	Algorithms	related_match	The grouping procedure uses network relationships rather than training a classifier on object labels. Domain-informed input selection or GO-dependent evaluation does not establish identity with a supervised classifier.
HAC-Q network clustering `AIMech:HACQ`	Algorithms	related_match	The procedure groups graph vertices using observed relationships rather than supervised label prediction. The task relation does not establish algorithm identity.
Information maximizing self-augmented training `AIMech:InformationMaximizingSelfAugmentedTraining`	Algorithms	related_match	The algorithm learns assignments for an unlabeled clustering task. For IMSAT this mapping concerns its categorical configuration, not binary hashing. The AIO target is a task; this is an algorithm-to-task association, not equivalence or an is-a assertion.
Invariant information clustering `AIMech:InvariantInformationClustering`	Algorithms	related_match	This procedure uses or directly learns unlabeled image cluster assignments. The pinned target is an unlabeled clustering task; this is a related algorithm-to-task association, not equivalence, a semantic class-label guarantee or an is-a assertion.
Joint unsupervised learning of deep representations and image clusters `AIMech:JointUnsupervisedLearning`	Algorithms	related_match	JULE assigns unlabeled images to clusters while learning their representation. The AIO target is a clustering task; this is an algorithm-to-task association, not equivalence or an is-a assertion.
Kernel K-Means `AIMech:KernelKMeans`	Algorithms	related_match	This fixed-kernel clustering algorithm performs the inspected unlabeled clustering task. The relation does not equate algorithm and task or assert an upstream subclass. KernelLayer, PCA, neural graph models and a nested cluster hierarchy have different scopes.
Llama clustering `AIMech:LlamaClustering`	Algorithms	related_match	The algorithm groups observations into overlapping sets from supplied linkage scores; this target denotes the grouping task, not this algorithm.
Multiclass Multiple Kernel Maximum Margin Clustering `AIMech:MulticlassMultipleKernelMaximumMarginClustering`	Algorithms	related_match	The inspected procedure performs unlabeled clustering; the AIO target is the related task, not an equivalent algorithm identity or asserted superclass. In this pin SupportVectorMachine is scoped as a supervised classification/regression network, and BinaryClassification and MulticlassClassification inherit supervised task scope. Shared margin terminology does not establish those identities.
Multiview Kernel K-Means `AIMech:MultiviewKernelKMeans`	Algorithms	related_match	This complete algorithm groups unlabeled aligned multiview observations. The inspected AIO target is a clustering task, so the association asserts neither equivalence nor an upstream subclass. A dot-product KernelLayer, PCA projection and neural RepresentationLearning have different scopes.
NeXO ontology construction `AIMech:NeXOOntologyConstruction`	Algorithms	related_match	The grouping procedure uses network relationships rather than training a classifier on object labels. Domain-informed input selection or GO-dependent evaluation does not establish identity with a supervised classifier.
Nearest-neighbor-chain clustering `AIMech:NearestNeighborChainClustering`	Algorithms	related_match	The selected setting groups unlabeled objects using dissimilarities. The AIO task does not specify reciprocal chains, admissible update laws or stepwise output.
Newman greedy modularity algorithm `AIMech:NewmanGreedyModularity`	Algorithms	related_match	Groups are derived from graph topology and modularity rather than supplied class labels. This relates an algorithm to a task without equating their identities.
Otsu thresholding `AIMech:OtsuThresholding`	Algorithms	related_match	The method groups unlabeled intensities into ordered classes by a between/within-class variance criterion. The AIO target describes an unsupervised grouping task; related_match connects that role without equating this specific threshold-selection algorithm with the task or requiring supervised classification.
Overlapping hierarchical clustering (OHC) `AIMech:OverlappingHierarchicalClustering`	Algorithms	related_match	Groups are constructed from supplied distances without reference labels. Structural comparisons to other hierarchies do not make the construction a supervised classifier.
PERCH clustering `AIMech:PERCHClustering`	Algorithms	related_match	The merge and rotation construction uses observations and distances without class labels; reference labels enter the reported external quality evaluation.
Path integral clustering `AIMech:PathIntegralClustering`	Algorithms	related_match	Path integral clustering groups unlabeled observations using a specified graph-based merge procedure. The AIO target is a clustering task, so this algorithm-to-task association does not assert equivalence or an is-a relation.
PoClustering edge-clique-cover heuristic `AIMech:PoClusteringEdgeCliqueCover`	Algorithms	related_match	The generic heuristic groups objects from pairwise dissimilarities without class-label supervision. Its directional reference-set metric is an evaluation choice.
Power iteration clustering `AIMech:PowerIterationClustering`	Algorithms	related_match	Power iteration clustering supplies a procedure for grouping unlabeled observations. The AIO target denotes a clustering task; this algorithm-to-task association does not assert equivalence or subclass membership.
ROCK clustering `AIMech:ROCKClustering`	Algorithms	related_match	ROCK groups unlabeled observations using a specified agglomerative procedure. The AIO target is a task; this association does not assert algorithm/task equivalence or subclass membership.
Radicchi edge-clustering community detection `AIMech:RadicchiEdgeClustering`	Algorithms	related_match	Local graph scores and optional degree tests produce unlabeled groupings from topology without class-label supervision.
Reciprocal-nearest-neighbors supported clustering `AIMech:ReciprocalNearestNeighborsSupportedClustering`	Algorithms	related_match	Distances determine groups without class labels; labels are used only in the cited external evaluation. This related task does not specify the pruning or representatives.
Regularized information maximization `AIMech:RegularizedInformationMaximization`	Algorithms	related_match	The unlabeled RIM configuration learns cluster assignments. The AIO target is the clustering task; this is an algorithm-to-task association, not an is-a assertion. The optional semi-supervised extension is stated separately.
Robust continuous clustering `AIMech:RobustContinuousClustering`	Algorithms	related_match	RCC constructs groups from observation features and graph relationships. The AIO target denotes the task; this relation does not equate the algorithm with a task or assert an upstream subclass.
SeLa `AIMech:SeLa`	Algorithms	related_match	This procedure uses or directly learns unlabeled image cluster assignments. The pinned target is an unlabeled clustering task; this is a related algorithm-to-task association, not equivalence, a semantic class-label guarantee or an is-a assertion.
Semidefinite Maximum Margin Clustering `AIMech:SemidefiniteMaximumMarginClustering`	Algorithms	related_match	The algorithm performs the inspected unlabeled clustering task through a label-matrix relaxation. This is a related task mapping, not algorithm-task equivalence or an upstream subclass. Supervised SVM, kernel layers, PCA projections and generic model terms have different scopes.
Sub-Cluster Component clustering `AIMech:SubClusterComponentClustering`	Algorithms	related_match	Groups are constructed from supplied dissimilarities without class labels. Evaluation labels and oracle round-selection experiments do not define the generic construction.
Support Vector Clustering `AIMech:SupportVectorClustering`	Algorithms	related_match	The procedure performs the inspected unlabeled clustering task, so AIO:UnsupervisedClustering is a related task mapping, not algorithm-task identity or an upstream subclass assertion. Inspected eight annotated AIO nodes and their generated records: UnsupervisedClustering, Clustering, UnsupervisedLearning, MachineLearningTask, SupportVectorMachine, Network, KernelLayer and Model. The supervised classification/regression network definition of SupportVectorMachine does not cover this unsupervised sphere-and-connectivity algorithm; a shared support-vector name is insufficient. Generic networks, kernel layers and model abstractions do not specify it. All442 AIO class labels and 153 semantic matches reuse byte-verified prior readings; expanded support/sphere/density/novelty/anomaly searches add no rows. KernelPCA, KernelKMeans and SemidefiniteMaximumMarginClustering were checked against their unchanged complete readings; DBSCAN and MeanShift were fully read as additional context. Their projections, variance objectives, label matrices, neighborhoods and mode updates differ from the selected sphere preimage and segment graph. Context is not renewed scientific approval.
SwAV `AIMech:SwAV`	Algorithms	related_match	SwAV uses balanced online soft assignments to learned prototypes in its representation-learning procedure. The pinned target is an unlabeled clustering task; this is a related algorithm-to-task association, not equivalence, a semantic class-label guarantee or an is-a assertion.
Unweighted Multiview Convex Mixture Clustering `AIMech:UnweightedMultiviewConvexMixtureClustering`	Algorithms	related_match	The procedure fits exemplar weights and constructs a grouping from unlabeled observations. The inspected AIO target is a clustering task; this algorithm-to-task association asserts neither equivalence nor an upstream subclass.
Ward minimum-variance clustering `AIMech:WardMinimumVarianceClustering`	Algorithms	related_match	The specified procedure groups unlabeled numeric observations using within-cluster dispersion. The task target does not specify the Ward criterion, greedy restriction or distance conventions.
Weighted Multiview Convex Mixture Clustering `AIMech:WeightedMultiviewConvexMixtureClustering`	Algorithms	related_match	The procedure fits exemplar weights and constructs a grouping from unlabeled observations. The inspected AIO target is a clustering task; this algorithm-to-task association asserts neither equivalence nor an upstream subclass.
Weighted Multiview Spectral Clustering `AIMech:WeightedMultiviewSpectralClustering`	Algorithms	related_match	This complete algorithm groups unlabeled aligned multiview observations. The inspected AIO target is a clustering task, so the association asserts neither equivalence nor an upstream subclass. A dot-product KernelLayer, PCA projection and neural RepresentationLearning have different scopes.
Zeta merging `AIMech:ZetaMerging`	Algorithms	related_match	Zeta merging supplies a procedure for grouping unlabeled observations. The AIO target denotes a clustering task; this algorithm-to-task association does not assert equivalence or subclass membership.
Zhou first-passage attractor community detection `AIMech:ZhouAttractorCommunityDetection`	Algorithms	related_match	The algorithm groups graph vertices using interaction topology and first-passage dynamics without label supervision. The AIO target denotes a clustering task, so this method-to-task relation is not an equivalence or algorithm is-a assertion.

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/UnsupervisedClustering.yaml