Proceedings of the 21st ACM International Conference on Information and Knowledge Management 2012
DOI: 10.1145/2396761.2396865
|View full text |Cite
|
Sign up to set email alerts
|

Predicting query performance for fusion-based retrieval

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 18 publications
(15 citation statements)
references
References 34 publications
0
15
0
Order By: Relevance
“…Markovits et al employ a simpler variant of WIG in a data fusion setting [8]. In this variant, called here ScoreAvg, instead of using rel(C, qi) for normalization as in WIG, the relevance scores rel(d, qi) are sum normalized to [0, 1] before computing their average.…”
Section: Baseline Qpps For Aspect Weightingmentioning
confidence: 99%
See 2 more Smart Citations
“…Markovits et al employ a simpler variant of WIG in a data fusion setting [8]. In this variant, called here ScoreAvg, instead of using rel(C, qi) for normalization as in WIG, the relevance scores rel(d, qi) are sum normalized to [0, 1] before computing their average.…”
Section: Baseline Qpps For Aspect Weightingmentioning
confidence: 99%
“…ScoreDev. This method [8] is a variant of NQC, and applies Eq. 2 without the normalization factor rel(C, qi).…”
Section: Baseline Qpps For Aspect Weightingmentioning
confidence: 99%
See 1 more Smart Citation
“…To estimate p(d|Iq) using information induced from the intermediate lists, and inspired by some recent work on predicting query-performance for fusion [25], we can write…”
Section: Exploiting the Special Characteristics Of The Fusion Settingmentioning
confidence: 99%
“…In this paper, we follow Arguello et al [3] and also use one copy of each source feature for every source, which yields better performance according to our experiments as well. Then, to solve our problem of blending results, we propose a pair-wise approach inspired by [3,15], but adapted to our problem as well as a point-wise approach similar in aim to the method described in [19], where it was outperformed by Round-Robin [21], and a list-wise approach that is the most fitted to our problem and allows us to use features from [12], where query performance was predicted.…”
Section: Related Workmentioning
confidence: 99%