73 search results - page 3 / 15 » Kernels of Directed Graph Laplacians |
ICML
2007
IEEE
16 years 13 days ago
2007
IEEE
Ranking nodes in graphs is of much recent interest. Edges, via the graph Laplacian, are used to encourage local smoothness of node scores in SVM-like formulations with generalizat...
93
Voted
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
89
Voted
ICML
2007
IEEE
16 years 13 days ago
2007
IEEE
We study the problem of discovering a manifold that best preserves information relevant to a nonlinear regression. Solving this problem involves extending and uniting two threads ...
ICML
2007
IEEE
16 years 13 days ago
2007
IEEE
Many kernel learning methods have to assume parametric forms for the target kernel functions, which significantly limits the capability of kernels in fitting diverse patterns. Som...
86
Voted
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
We extend the resistance distance kernel to the domain of signed dissimilarity values, and show how it can be applied to collaborative rating prediction. The resistance distance is...