Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs
원문 초록
This article unveils a new relation between the Nishimori temperature parametrizing a distribution P and the Bethe free energy on random Erdos-Renyi graphs with edge weights distributed according to P. Estimating the Nishimori temperature being a task of major importance in Bayesian inference problems, as a practical corollary of this new relation, a numerical method is proposed to accurately estimate the Nishimori temperature from the eigenvalues of the Bethe Hessian matrix of the weighted graph. The algorithm, in turn, is used to propose a new spectral method for node classification in weighted (possibly sparse) graphs. The superiority of the method over competing state-of-the-art approaches is demonstrated both through theoretical arguments and real-world data experiments.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Network Together: Node Classification via Cross-Network Deep Network Embedding
MRAEA: An Efficient and Robust Entity Alignment Approach for Cross-lingual Knowledge Graph
A Single Attention-Based Combination of CNN and RNN for Relation Classification
GraRep: Learning Graph Representations with Global Structural Information
Statistical Machine Learning for Astronomy -- A Textbook
A Simple Approximate Bayesian Inference Neural Surrogate for Stochastic Petri Net Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.