30 search results - page 1 / 6 » Learning spectral graph transformations for link prediction |
76
Voted
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
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...
IPMU
2010
Springer
14 years 11 months ago
2010
Springer
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...
JCDL
2009
ACM
15 years 4 months ago
2009
ACM
101
click to vote
TIT
2008
14 years 9 months ago
2008
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...
92
Voted
WCC
2005
Springer
15 years 3 months ago
2005
Springer
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. ...