Showing stat.MLShow all
2 papers · 1 filter
stat.ML2019
A Maximum Entropy approach to Massive Graph Spectra
Diego Granziol, Robin Ru, Stefan Zohren +3
Graph spectral techniques for measuring graph similarity, or for learning the cluster number, require kernel smoothing. The choice of kernel function and bandwidth are typically ch…
stat.ML2018
Entropic Spectral Learning for Large-Scale Graphs
Diego Granziol, Binxin Ru, Stefan Zohren +3
Graph spectra have been successfully used to classify network types, compute the similarity between graphs, and determine the number of communities in a network. For large graphs,…