Sciweavers

Share
30 search results - page 1 / 6
» Learning spectral graph transformations for link prediction
Sort
View
ICML
2009
IEEE
11 years 3 months ago
Learning spectral graph transformations for link prediction
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 spectru...
Andreas Lommatzsch, Jérôme Kunegis
IPMU
2010
Springer
10 years 4 months ago
The Link Prediction Problem in Bipartite Networks
We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction functio...
Jérôme Kunegis, Ernesto William De Lu...
TIT
2008
224views more  TIT 2008»
10 years 2 months ago
Graph-Based Semi-Supervised Learning and Spectral Kernel Design
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...
Rie Johnson, Tong Zhang
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
10 years 8 months ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker
books