@graphty/algorithms / index / spectralClustering
Function: spectralClustering() ​
spectralClustering(
graph,options):SpectralClusteringResult
Defined in: clustering/spectral.ts:44
Perform spectral clustering on a graph
Note: This implementation uses simplified power iteration for eigenvector computation with approximate eigenvalues. For production use cases requiring precise clustering, consider using a proper linear algebra library like ml-matrix.
The approximate eigenvalues (0.1, 0.2 for second and third eigenvectors) work well for most graph structures but may produce suboptimal results for graphs with unusual spectral properties.
Parameters ​
graph ​
The input graph to cluster
options ​
Spectral clustering options (k, laplacianType, etc.)
Returns ​
Spectral clustering result with communities and cluster assignments