Is Query Performance Prediction With Multiple Query Variations Harder Than Topic Performance Prediction?

Oleg Zendel|J. Shane Culpepper|Falk Scholer


Anthology ID:DBLP:conf/sigir/ZendelCS21
Volume:SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, Virtual Event, Canada, July 11-15, 2021
Year:2021
Venue:Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR)
Publisher:ACM
Pages:1713-1717
URL:https://doi.org/10.1145/3404835.3463039
DOI:https://doi.org/10.1145/3404835.3463039
DBLP:conf/sigir/ZendelCS21
BibTeX:
@inproceedings{zendel-2021-query, author = {Oleg Zendel and J. Shane Culpepper and Falk Scholer}, editor = {Fernando Diaz and Chirag Shah and Torsten Suel and Pablo Castells and Rosie Jones and Tetsuya Sakai}, title = {{Is Query Performance Prediction With Multiple Query Variations Harder Than Topic Performance Prediction?}}, booktitle = {{SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, Virtual Event, Canada, July 11-15, 2021}}, pages = {1713--1717}, publisher = {ACM}, year = {2021}, url = {https://doi.org/10.1145/3404835.3463039}, doi = {https://doi.org/10.1145/3404835.3463039} }