Clustering

Clustering partitions a pool of sequences or trajectories into groups based on pairwise distances.

Available Algorithms

Algorithm	Characteristics
HierarchicalClusterer	Produces nested partitions at all distance thresholds.
PAMClusterer	Medoid-based; robust to outliers; slower on large datasets
CLARAClusterer	Scalable variant of PAM; samples subsets repeatedly for speed

See Also

• Clustering - Worked examples for each algorithm

• Metrics - Sequence and trajectory metrics used to compute distance matrices for clustering