-
class
Abstract clustering model that produces (for each test instance)
an estimate of the membership in each cluster
(ie.
class
Cluster data using the capopy clustering algorithm, which requires just one pass over the data.
class
Class implementing the Cobweb and Classit clustering algorithms.
Note: the application of node operators (merging, splitting etc.) in terms of ordering and priority differs (and is somewhat ambiguous) between the original Cobweb and Classit papers.
class
Simple EM (expectation maximisation) class.
EM assigns a probability distribution to each instance which indicates the probability of it belonging to each of the clusters.
class
Cluster data using the FarthestFirst algorithm.
For more information see:
Hochbaum, Shmoys (1985).
class
Class for running an arbitrary clusterer on data
that has been passed through an arbitrary filter.
class
Hierarchical clustering class.
class
Class for wrapping a Clusterer to make it return a
distribution and density.
class
Abstract utility class for handling settings common to randomizable
clusterers.
class
Abstract utility class for handling settings common to randomizable
clusterers.
class
Abstract utility class for handling settings common to randomizable
clusterers.
class
Cluster data using the k means algorithm.
class
Meta-clusterer for enhancing a base clusterer.