Perform spectral classification on the similarity matrix of a dataset (Ng et al. (2001) algorithm), using kmeans algorithm on data projected in the space of its K first eigen vectors.
Usage
KpartitionNJW(similarity, K)
Arguments
similarity
matrix of similarity.
K
number of clusters.
Value
The function returns a list containing:
label
vector of cluster sequencing.
centres
matrix of cluster centers in the space of the K first normalised eigen vectors.
vecteursPropresProjK
matrix containing, in columns, the K first normalised eigen vectors of the similarity matrix.
valeursPropresK
vector containing the K first eigen values of the similarity matrix.
vecteursPropres
matrix containing, in columns, eigen vectors of the similarity matrix.
valeursPropres
vector containing eigen values of the similarity matrix.
inertieZ
vector of within-cluster sum of squares, one component per cluster.
References
Ng Andrew, Y., M. I. Jordan, and Y. Weiss. "On spectral clustering: analysis and an algorithm [C]." Advances in Neural Information Processing Systems (2001).