2018 search results - page 121 / 404 » Magnitude-preserving ranking algorithms |
145
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
154
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
159
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
As with any application of machine learning, web search ranking requires labeled data. The labels usually come in the form of relevance assessments made by editors. Click logs can...
196
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
263
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...