A Maximum Entropy approach to Massive Graph Spectra
원문 초록
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 chosen in an ad-hoc manner and heavily affect the resulting output. We prove that kernel smoothing biases the moments of the spectral density. We propose an information theoretically optimal approach to learn a smooth graph spectral density, which fully respects the moment information. Our method's computational cost is linear in the number of edges, and hence can be applied to large networks, with millions of nodes. We apply our method to the problems to graph similarity and cluster number learning, where we outperform comparable iterative spectral approaches on synthetic and real graphs.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval
HeGMN: Heterogeneous Graph Matching Network for Learning Graph Similarity
Quality Measures for Dynamic Graph Generative Models
Neural Network Graph Similarity Computation Based on Graph Fusion
GraSP: Simple yet Effective Graph Similarity Predictions
Covered Forest: Fine-grained generalization analysis of graph neural networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.