Efficient Estimation of Shortest-Path Distance Distributions to Samples in Graphs

Documenti analoghi

• Flexible Diffusion Scopes with Parameterized Laplacian for Heterophilic Graph Learning
  di: Lu, Qincheng, et al.
  Pubblicazione: (2024)
• A Spectral Framework for Evaluating Geodesic Distances Between Graphs
  di: Shuvo, Soumen Sikder, et al.
  Pubblicazione: (2024)
• Bypassing Skip-Gram Negative Sampling: Dimension Regularization as a More Efficient Alternative for Graph Embeddings
  di: Liu, David, et al.
  Pubblicazione: (2024)
• NodeNAS: Node-Specific Graph Neural Architecture Search for Out-of-Distribution Generalization
  di: Wang, Qiyi, et al.
  Pubblicazione: (2025)
• MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering
  di: Hu, Jun, et al.
  Pubblicazione: (2022)