Sciweavers

77 search results - page 12 / 16
» Score Aggregation Techniques in Retrieval Experimentation
Sort
View
AIRS
2005
Springer
14 years 28 days ago
Query Expansion with the Minimum Relevance Judgments
Query expansion techniques generally select new query terms from a set of top ranked documents. Although a user’s manual judgment of those documents would much help to select goo...
Masayuki Okabe, Kyoji Umemura, Seiji Yamada
ICDE
2008
IEEE
336views Database» more  ICDE 2008»
14 years 8 months ago
Dominant Graph: An Efficient Indexing Structure to Answer Top-K Queries
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
Lei Zou, Lei Chen 0002
WWW
2007
ACM
14 years 8 months ago
Geotracker: geospatial and temporal RSS navigation
The Web is rapidly moving towards a platform for mass collaboration in content production and consumption. Fresh content on a variety of topics, people, and places is being create...
Yih-Farn Robin Chen, Giuseppe Di Fabbrizio, David ...
CIKM
2009
Springer
13 years 11 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
VLDB
2007
ACM
124views Database» more  VLDB 2007»
14 years 1 months ago
Ad-hoc Top-k Query Answering for Data Streams
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
Gautam Das, Dimitrios Gunopulos, Nick Koudas, Niko...