Sciweavers

224 search results - page 38 / 45
» Neighborhood systems and approximate retrieval
Sort
View
105
Voted
SIGIR
2010
ACM
15 years 4 months ago
Extending average precision to graded relevance judgments
Evaluation metrics play a critical role both in the context of comparative evaluation of the performance of retrieval systems and in the context of learning-to-rank (LTR) as objec...
Stephen E. Robertson, Evangelos Kanoulas, Emine Yi...
96
Voted
SIGIR
2008
ACM
15 years 1 days ago
Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
Efficient similarity search in high-dimensional spaces is important to content-based retrieval systems. Recent studies have shown that sketches can effectively approximate L1 dist...
Wei Dong, Moses Charikar, Kai Li
TOCHI
2010
90views more  TOCHI 2010»
14 years 10 months ago
Potential for personalization
Current Web search tools do a good job of retrieving documents that satisfy the wide range of intentions that people associate with a query – but do not do a very good job of di...
Jaime Teevan, Susan T. Dumais, Eric Horvitz
89
Voted
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 16 days ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
SIGMOD
2004
ACM
188views Database» more  SIGMOD 2004»
16 years 8 days ago
Online Event-driven Subsequence Matching over Financial Data Streams
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
Huanmei Wu, Betty Salzberg, Donghui Zhang