3395 search results - page 37 / 679 » Learning to efficiently rank |
161
click to vote
IWPEC
2010
Springer
15 years 1 months ago
2010
Springer
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
162
Voted
ISNN
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we introduce a new instance-based approach to the label ranking problem. This approach is based on a probability model on rankings which is known as the Mallows mode...
132
click to vote
NAACL
2007
15 years 4 months ago
2007
We address the problem of analyzing multiple related opinions in a text. For instance, in a restaurant review such opinions may include food, ambience and service. We formulate th...
130
Voted
ALT
2008
Springer
16 years 9 days ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
142
Voted
ICML
2007
IEEE
16 years 4 months ago
2007
IEEE
The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative fil...