2100 search results - page 88 / 420 » Learning to rank on graphs |
133
click to vote
JMLR
2010
15 years 1 months ago
2010
Hsu et al. (2009) recently proposed an efficient, accurate spectral learning algorithm for Hidden Markov Models (HMMs). In this paper we relax their assumptions and prove a tighte...
184
click to vote
GECCO
2005
Springer
15 years 11 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
163
click to vote
IAT
2009
IEEE
16 years 29 days ago
2009
IEEE
This paper proposes an automated web site evaluation approach using machine learning to cope with ranking problems. Evaluating web sites is a significant task for web service beca...
145
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We are interested in supervised ranking with the following twist: our goal is to design algorithms that perform especially well near the top of the ranked list, and are only requir...
162
click to vote
NAACL
2007
15 years 7 months ago
2007
Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. All graph-based algorithms rely ...