Learned Indexing in Proteins: Substituting Complex Distance Calculations with Embedding and Clustering Techniques

Logo poskytovatele

Varování

Publikace nespadá pod Ekonomicko-správní fakultu, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.
Autoři

OĽHA Jaroslav SLANINÁKOVÁ Terézia GENDIAR Martin ANTOL Matej DOHNAL Vlastislav

Rok publikování 2022
Druh Článek ve sborníku
Konference Similarity Search and Applications, 15th International Conference, SISAP 2022, Bologna, Italy, October 5–7, 2022, Proceedings
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www https://link.springer.com/chapter/10.1007/978-3-031-17849-8_22
Doi http://dx.doi.org/10.1007/978-3-031-17849-8_22
Klíčová slova Protein database;Embedding non-vector data;Learned metric index;Similarity search;Machine learning for indexing
Popis Despite the constant evolution of similarity searching research, it continues to face challenges stemming from the complexity of the data, such as the curse of dimensionality and computationally expensive distance functions. Various machine learning techniques have proven capable of replacing elaborate mathematical models with simple linear functions, often gaining speed and simplicity at the cost of formal guarantees of accuracy and correctness of querying. The authors explore the potential of this research trend by presenting a lightweight solution for the complex problem of 3D protein structure search. The solution consists of three steps – (i) transformation of 3D protein structural information into very compact vectors, (ii) use of a probabilistic model to group these vectors and respond to queries by returning a given number of similar objects, and (iii) a final filtering step which applies basic vector distance functions to refine the result.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.