550 search results - page 17 / 110 » A general magnitude-preserving boosting algorithm for search... |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
ICML
2007
IEEE
14 years 8 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...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
SIGIR
2009
ACM
14 years 2 months ago
2009
ACM
Incorporating features extracted from clickthrough data (called clickthrough features) has been demonstrated to significantly improve the performance of ranking models for Web sea...
WSDM
2010
ACM
14 years 4 months ago
2010
ACM
In web search, recency ranking refers to ranking documents by relevance which takes freshness into account. In this paper, we propose a retrieval system which automatically detect...