2100 search results - page 123 / 420 » Learning to rank on graphs |
157
click to vote
NAACL
1994
15 years 7 months ago
1994
The normal practice of selecting relevant documents for training routing queries is to either use all relevants or the 'best n' of them after a (retrieval) ranking opera...
172
click to vote
ICDM
2007
IEEE
16 years 22 days ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
168
click to vote
WEBDB
2007
Springer
16 years 16 days ago
2007
Springer
This paper pursues the recently emerging paradigm of searching for entities that are embedded in Web pages. We utilize informationextraction techniques to identify entity candidat...
172
click to vote
COLT
2005
Springer
15 years 12 months ago
2005
Springer
In the machine learning community it is generally believed that graph Laplacians corresponding to a finite sample of data points converge to a continuous Laplace operator if the s...
149
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...