Material Detail

Learning Spectral Graph Transformations for Link Prediction

Learning Spectral Graph Transformations for Link Prediction

This video was recorded at 26th International Conference on Machine Learning (ICML), Montreal 2009. We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectrum. Our approach generalizes several graph kernels and dimensionality reduction methods and provides a method to estimate their parameters efficiently. We show how the parameters of these prediction functions can be learned by reducing the problem to a one-dimensional regression problem whose runtime only depends on the method's reduced rank and that can be inspected visually. We derive variants that apply to undirected, weighted, unweighted, unipartite and bipartite graphs. We evaluate our method experimentally using... Show More
Rate

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Learning Spectral Graph Transformations for Link Prediction

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.
hidden