Source header: cuvs/preprocessing/spectral_embedding.hpp
Parameters for spectral embedding algorithm
Spectral embedding is a dimensionality reduction technique that uses the eigenvectors of the graph Laplacian to embed data points into a lower-dimensional space. This technique is particularly useful for non-linear dimensionality reduction and clustering tasks.
Fields
Perform spectral embedding on input dataset
This function computes the spectral embedding of the input dataset by:
Parameters
Returns
void
Additional overload: preprocessing::spectral_embedding::transform
Perform spectral embedding using a precomputed connectivity graph
This function computes the spectral embedding from a precomputed sparse connectivity graph (e.g., from a k-NN search or custom similarity matrix). This is useful when you want to use a custom graph construction method or when you have a precomputed similarity/affinity matrix.
The function:
Parameters
Returns
void