306 search results - page 33 / 62 » Efficient Margin-Based Rank Learning Algorithms for Informat... |
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
CIKM
2009
Springer
14 years 10 days ago
2009
Springer
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
In this paper, we tackle the problem of top-N context-aware recommendation for implicit feedback scenarios. We frame this challenge as a ranking problem in collaborative filterin...
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
ICMCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Query reformulation has been suggested as an effective way to improve retrieval efficiency in text information retrieval and one of the well-known techniques for query reformulati...