2100 search results - page 236 / 420 » Learning to rank on graphs |
180
click to vote
ICML
2007
IEEE
16 years 7 months 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...
187
click to vote
ECML
2007
Springer
16 years 24 days ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
202
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
192
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
147
click to vote
LREC
2008
15 years 8 months ago
2008
In this work we propose a new strategy for the authorship identification problem and we test it on an example from Romanian literature: did Radu Albala found the continuation of M...