Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Extending Probabilistic Data Fusion Using Sliding Windows (1410.2634v1)

Published 9 Oct 2014 in cs.IR

Abstract: Recent developments in the field of data fusion have seen a focus on techniques that use training queries to estimate the probability that various documents are relevant to a given query and use that information to assign scores to those documents on which they are subsequently ranked. This paper introduces SlideFuse, which builds on these techniques, introducing a sliding window in order to compensate for situations where little relevance information is available to aid in the estimation of probabilities. SlideFuse is shown to perform favourably in comparison with CombMNZ, ProbFuse and SegFuse. CombMNZ is the standard baseline technique against which data fusion algorithms are compared whereas ProbFuse and SegFuse represent the state-of-the-art for probabilistic data fusion methods.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. David Lillis (24 papers)
  2. Fergus Toolan (2 papers)
  3. Rem W. Collier (4 papers)
  4. John Dunnion (2 papers)
Citations (20)

Summary

We haven't generated a summary for this paper yet.