Skip to main content
. Author manuscript; available in PMC: 2018 May 1.
Published in final edited form as: IEEE Trans Neural Netw Learn Syst. 2016 Feb 18;28(5):1123–1138. doi: 10.1109/TNNLS.2015.2511179

Algorithm 1.

Normalized Spectral Clustering

Step 1: Construct the graph G on the given data set X and calculate the similarity matrix W;
Step 2: Generate the normalized Laplacian matrix = D–1/2LD–1/2;
Step 3: Obtain the K relaxed continuous solutions (the first K eigenvectors) of Eq. (4) based on the eigenvalue decomposition on ;
Step 4: Generate the final discrete solution via K-means [18] or spectral rotation [6], [10] based on these continuous solutions.