Simon Ding

When I implemented the spectral clustering I thought that the eigendecomposition should always work on real symmetric matrices (Spectral Theorem), and the Laplacian matrix in SpectralClustering.java is symmetric by construction....

> - Symmetric similarity: $\frac{2m}{a+b}$ (better name required) This is equivalent to the Jaccard Index, aka. the Jaccard similarity coefficient, or intersection over union. Also, it would be interesting to...