Clustering Guide

Use these guides for NVIDIA cuVS clustering APIs that group related vectors or build graph structures from pairwise relationships.

• K-Means: partition vectors into a fixed number of clusters, often for scalable vector-search partitioning.
• Single-linkage: build hierarchical clusters from nearest-neighbor relationships.
• Spectral Clustering: use graph structure and spectral methods to find clusters with more complex shapes.