Sciweavers

194 search results - page 31 / 39
» Learning to rank query reformulations
Sort
View
WWW
2008
ACM
16 years 11 days ago
Mining the search trails of surfing crowds: identifying relevant websites from user activity
The paper proposes identifying relevant information sources from the history of combined searching and browsing behavior of many Web users. While it has been previously shown that...
Mikhail Bilenko, Ryen W. White
KDD
2002
ACM
169views Data Mining» more  KDD 2002»
16 years 2 days ago
Optimizing search engines using clickthrough data
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
Thorsten Joachims
IUI
2003
ACM
15 years 5 months ago
Adapting to the user's internet search strategy on small devices
World Wide Web search engines typically return thousands of results to the users. To avoid users browsing through the whole list of results, search engines use ranking algorithms ...
Jean-David Ruvini
ACCV
2007
Springer
15 years 1 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 6 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King