| (1) | Input: A data matrix , the number of neighbors , and the number of clusters . |
| (2) | Output: The affinity graph . |
| (3) | Initialize: The graph is initialized by equation (9) where we replace by ; is initialized with initial graph by solving equation (8); and . |
| (4) | Iterate equation (1) several times. |
| (5) | While not converge do |
| (6) | Fordo |
| (7) | Update by using equation (12); |
| (8) | end for |
| (9) | ; |
| (10) | Update by using equation (8), i.e., is formed by eigenvectors with the top smallest eigenvalues of . |
| (11) | end while |
