2100 search results - page 127 / 420 » Learning to rank on graphs |
219
click to vote
ICANN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper studies a risk minimization approach to estimate a transformation model from noisy observations. It is argued that transformation models are a natural candidat...
188
click to vote
JMLR
2012
13 years 9 months ago
2012
We propose a new method for comparing learning algorithms on multiple tasks which is based on a novel non-parametric test that we call the Poisson binomial test. The key aspect of...
197
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
227
click to vote
DEBU
2010
15 years 6 months ago
2010
The proliferation of knowledge-sharing communities like Wikipedia and the advances in automated information extraction from Web pages enable the construction of large knowledge ba...
192
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...