| MÍČ, Vladimír, Tomáš RAČEK, Aleš KŘENEK a Pavel ZEZULA. Similarity Search for an Extreme Application: Experience and Implementation. In Nora Reyes, Richard Connor, Nils Kriege, Daniyal Kazempour, Ilaria Bartolini, Erich Schubert, Jian-Jia Chen. Similarity Search and Applications: 14th International Conference, SISAP 2021, Dortmund, Germany, September 29 - October 1, 2021, Proceedings. Cham: Springer. s. 265-279. ISBN 978-3-030-89656-0. doi:10.1007/978-3-030-89657-7_20. 2021. |
Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1799684,
author = {Míč, Vladimír and Raček, Tomáš and Křenek, Aleš and Zezula, Pavel},
address = {Cham},
booktitle = {Similarity Search and Applications: 14th International Conference, SISAP 2021, Dortmund, Germany, September 29 - October 1, 2021, Proceedings},
doi = {http://dx.doi.org/10.1007/978-3-030-89657-7_20},
editor = {Nora Reyes, Richard Connor, Nils Kriege, Daniyal Kazempour, Ilaria Bartolini, Erich Schubert, Jian-Jia Chen},
keywords = {Similarity search in metric space;Efficiency;Distance distribution;Dimensionality curse;Extreme distance function},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Cham},
isbn = {978-3-030-89656-0},
pages = {265-279},
publisher = {Springer},
title = {Similarity Search for an Extreme Application: Experience and Implementation},
url = {https://link.springer.com/chapter/10.1007/978-3-030-89657-7_20},
year = {2021}
}
TY - JOUR
ID - 1799684
AU - Míč, Vladimír - Raček, Tomáš - Křenek, Aleš - Zezula, Pavel
PY - 2021
TI - Similarity Search for an Extreme Application: Experience and Implementation
PB - Springer
CY - Cham
SN - 9783030896560
KW - Similarity search in metric space;Efficiency;Distance distribution;Dimensionality curse;Extreme distance function
UR - https://link.springer.com/chapter/10.1007/978-3-030-89657-7_20
N2 - Contemporary challenges for efficient similarity search include complex similarity functions, the curse of dimensionality, and large sizes of descriptive features of data objects. This article reports our experience with a database of protein chains which form (almost) metric space and demonstrate the following extreme properties. Evaluation of the pairwise similarity of protein chains can take even tens of minutes, and has a variance of six orders of magnitude. The minimisation of a number of similarity comparisons is thus crucial, so we propose a generic three stage search engine to solve it. We improve the median searching time 73 times in comparison with the search engine currently employed for the protein database in practice.
ER -
MÍČ, Vladimír, Tomáš RAČEK, Aleš KŘENEK a Pavel ZEZULA. Similarity Search for an Extreme Application: Experience and Implementation. In Nora Reyes, Richard Connor, Nils Kriege, Daniyal Kazempour, Ilaria Bartolini, Erich Schubert, Jian-Jia Chen. \textit{Similarity Search and Applications: 14th International Conference, SISAP 2021, Dortmund, Germany, September 29 - October 1, 2021, Proceedings}. Cham: Springer. s.~265-279. ISBN~978-3-030-89656-0. doi:10.1007/978-3-030-89657-7\_{}20. 2021.
|
