# Learning Spectral Graph Transformations for Link Prediction

## by Jérôme Kunegis, Web science, data mining and machine learning researcher at Institute for Web Science and Technologies, University of Koblenz–Landau on *Feb 14, 2011*

**1,025**views

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 ...

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 eﬃciently. 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 examples from social networks, collaborative filtering, trust networks, citation networks, authorship graphs and hyperlink networks.

### Statistics

### Views

- Total Views
- 1,025
- Views on SlideShare
- 1,025
- Embed Views

### Actions

- Likes
- 0
- Downloads
- 5
- Comments
- 0

### Accessibility

### Upload Details

Uploaded via SlideShare as Adobe PDF

### Usage Rights

© All Rights Reserved

No comments yet1