Spectral clustering is the task of finding good clusters by using information contained in the eigenvectors of a matrix derived from the data.
the number of edges between documents in different languages is about as many as the number of must-linked constraints given.