Coverage-Optimized Retrieval
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1349-1349.
Abstract
We present a generalization of similarity-based retrieval in recommender systems which ensures that for any case that is acceptable to the user, the retrieval set contains a case that is at least as good in an objective sense and so also likely to be acceptable. Our approach recognizes that similarity to the target query is only one of several possible criteria according to which a given case might be considered at least as good as another.
David McSherry. 2003. Coverage-Optimized Retrieval. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 1349–1349. https://ijcai.org/proceedings/2003/194
McSherry, D. (2003). Coverage-Optimized Retrieval. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 (pp. 1349–1349). IJCAI. https://ijcai.org/proceedings/2003/194
@inproceedings{ijcai2003p194,
title = {Coverage-Optimized Retrieval},
author = {McSherry, David},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {1349--1349},
year = {2003},
url = {https://ijcai.org/proceedings/2003/194},
}
TY - CPAPER TI - Coverage-Optimized Retrieval AU - McSherry, David T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 1349 EP - 1349 UR - https://ijcai.org/proceedings/2003/194 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
