Concept of Relational Similarity Search
| Authors | |
|---|---|
| Year of publication | 2022 |
| Type | Article in Proceedings |
| Conference | Similarity Search and Applications: 15th International Conference, SISAP 2022, Bologna, Italy, October 5 - October 7, 2022, Proceedings |
| MU Faculty or unit | |
| Citation | |
| Web | https://link.springer.com/chapter/10.1007/978-3-031-17849-8_8 |
| Doi | http://dx.doi.org/10.1007/978-3-031-17849-8_8 |
| Keywords | Efficient similarity search;Relational similarity;Similarity comparisons;Effective similarity search |
| Description | For decades, the success of the similarity search has been based on a detailed quantification of pairwise similarity of objects. Currently, the search features have become much more precise but also bulkier, and the similarity computations more time-consuming. While the k nearest neighbours (kNN) search dominates the real-life applications, we claim that it is principally free of a need for precise similarity quantifications. Based on the well-known fact that a selection of the most similar alternative out of several options is a much easier task than deciding the absolute similarity scores, we propose the search based on an epistemologically simpler concept of relational similarity. Having arbitrary objects q,o1,o2 from the search domain, the kNN search is solvable just by the ability to choose the more similar object to q out of o1,o2 – the decision can also contain a neutral option. We formalise such searching and discuss its advantages concerning similarity quantifications, namely its efficiency and robustness. We also propose a pioneering implementation of the relational similarity search for the Euclidean spaces and report its extreme filtering power in comparison with 3 contemporary techniques. |
| Related projects: |