2100 search results - page 85 / 420 » Learning to rank on graphs |
161
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
147
click to vote
HT
2009
ACM
16 years 21 days ago
2009
ACM
In previous research it has been shown that link-based web page metrics can be used to predict experts’ assessment of quality. We are interested in a related question: do expert...
146
click to vote
ADBIS
2006
Springer
16 years 5 days ago
2006
Springer
The Web is a typical example of a social network. One of the most intriguing features of the Web is its self-organization behavior, which is usually faced through the existence of ...
176
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
154
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Many of the recently proposed algorithms for learning feature-based ranking functions are based on the pairwise preference framework, in which instead of taking documents in isola...