spectral: Regularized spectral clustering

In greed: Clustering and Model Selection with the Integrated Classification Likelihood

Regularized spectral clustering

Description

performs regularized spectral clustering of a sparse adjacency matrix

Usage

spectral(X, K)

Arguments

X	An adjacency matrix in sparse format (see the Matrix package)
K	Desired number of cluster

Value

cl Vector of cluster labels

References

Tai Qin, Karl Rohe. Regularized Spectral Clustering under the Degree-Corrected Stochastic Block Model. Nips 2013.

greed documentation built on Oct. 4, 2022, 1:06 a.m.