Sciweavers

1605 search results - page 193 / 321
» Metric Learning to Rank
Sort
View
ICML
2008
IEEE
16 years 4 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash
WWW
2008
ACM
16 years 4 months 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
142
Voted
KDD
2002
ACM
169views Data Mining» more  KDD 2002»
16 years 4 months 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 9 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
118
Voted
CIKM
2008
Springer
15 years 6 months ago
Error-driven generalist+experts (edge): a multi-stage ensemble framework for text categorization
We introduce a multi-stage ensemble framework, ErrorDriven Generalist+Expert or Edge, for improved classification on large-scale text categorization problems. Edge first trains a ...
Jian Huang 0002, Omid Madani, C. Lee Giles