Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{958181,
author = {Kyselák, Martin and Novák, David and Zezula, Pavel},
address = {New York},
booktitle = {Fourth International Conference on Similarity Search and Applications, SISAP 2011},
doi = {http://dx.doi.org/10.1145/1995412.1995422},
editor = {Alfredo Ferro},
keywords = {locality-sensitive hashing; metric space; similarity search; recall; stability;},
howpublished = {tištěná verze "print"},
language = {eng},
location = {New York},
isbn = {978-1-4503-0795-6},
pages = {59-66},
publisher = {ACM Press},
title = {Stabilizing the Recall in Similarity Search},
year = {2011}
}
TY - JOUR
ID - 958181
AU - Kyselák, Martin - Novák, David - Zezula, Pavel
PY - 2011
TI - Stabilizing the Recall in Similarity Search
PB - ACM Press
CY - New York
SN - 9781450307956
KW - locality-sensitive hashing
KW - metric space
KW - similarity search
KW - recall
KW - stability;
N2 - The recent techniques for approximate similarity search focus on optimizing answer precision/recall and they typically improve the average of these measures over a set of sample queries. However, according to our observation, the recall for particular indexes and queries can fluctuate considerably. In order to stabilize the recall, we propose a query-evaluation model that exploits several variants of the search index. This approach is applicable to a signicant subset of current approximate methods with a focus on techniques based purely on metric postulates. Applying this approach to the M-Index structure, we perform extensive measurements on large datasets and we show that this approach has a positive impact on the recall stability and it suppresses the most unsatisfactory cases. Further, the results indicate that the proposed approach can also increase the general average recall for given overall search costs.
ER -
KYSELÁK, Martin, David NOVÁK a Pavel ZEZULA. Stabilizing the Recall in Similarity Search. In Alfredo Ferro. \textit{Fourth International Conference on Similarity Search and Applications, SISAP 2011}. New York: ACM Press. s.~59-66. ISBN~978-1-4503-0795-6. doi:10.1145/1995412.1995422. 2011.
|
