This is an implementation of the paper Learning Laplacian Matrix in Smooth Graph Signal Representations
https://arxiv.org/pdf/1406.7842.pdf
The original code can be found on the authors website web.media.mit.edu/~xdong/pub.html
- Precision, Recall, F-measure are comparable to those mentioned in the paper for both ER graph and Gaussian RBF. For BA graph, it is less.
- No parameters are changed for Gaussian RBF. For ER the threshold is slightly increased.
If you spot any bugs feel free to open an issue or mail me: ark.sadhu2904@gmail.com