2100 search results - page 137 / 420 » Learning to rank on graphs |
152
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
186
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
134
click to vote
COLT
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of learning a general graph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden grap...
291
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
Authority flow is an effective ranking mechanism for answering queries on a broad class of data. Systems have been developed to apply this principle on the Web (PageRank and topic ...
165
click to vote
NIPS
2004
15 years 7 months ago
2004
The area under the ROC curve (AUC) has been advocated as an evaluation criterion for the bipartite ranking problem. We study large deviation properties of the AUC; in particular, ...