arXiv:1602.02386
Network Inference by Learned Node-Specific Degree Prior
원문 초록
We propose a novel method for network inference from partially observed edges using a node-specific degree prior. The degree prior is derived from observed edges in the network to be inferred, and its hyper-parameters are determined by cross validation. Then we formulate network inference as a matrix completion problem regularized by our degree prior. Our theoretical analysis indicates that this prior favors a network following the learned degree distribution, and may lead to improved network recovery error bound than previous work. Experimental results on both simulated and real biological networks demonstrate the superior performance of our method in various settings.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
Interference-Aware Edge Runtime Prediction with Conformal Matrix Completion
Robust Matrix Completion for Discrete Rating-Scale Data
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.