On the Application of Convex Transforms to Metric Search
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00116150" target="_blank" >RIV/00216224:14330/20:00116150 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/abs/pii/S0167865520303068" target="_blank" >https://www.sciencedirect.com/science/article/abs/pii/S0167865520303068</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.patrec.2020.08.008" target="_blank" >10.1016/j.patrec.2020.08.008</a>
Alternative languages
Result language
angličtina
Original language name
On the Application of Convex Transforms to Metric Search
Original language description
Scalable similarity search in metric spaces relies on using the mathematical properties of the space in order to allow efficient querying. Most important in this context is the triangle inequality property, which can allow the majority of individual similarity comparisons to be avoided for a given query. However many important metric spaces, typically those with high dimensionality, are not amenable to such techniques. In the past convex transforms have been studied as a pragmatic mechanism which can overcome this effect; however the problem with this approach is that the metric properties may be lost, leading to loss of accuracy. Here, we study the underlying properties of such transforms and their effect on metric indexing mechanisms. We show there are some spaces where certain transforms may be applied without loss of accuracy, and further spaces where we can understand the engineering tradeoffs between accuracy and efficiency. We back these observations with experimental analysis. To highlight the value of the approach, we show three large spaces deriving from practical domains whose dimensionality prevents normal indexing techniques, but where the transforms applied give scalable access with a relatively small loss of accuracy.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF16_019%2F0000822" target="_blank" >EF16_019/0000822: CyberSecurity, CyberCrime and Critical Information Infrastructures Center of Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Pattern Recognition Letters
ISSN
0167-8655
e-ISSN
—
Volume of the periodical
138
Issue of the periodical within the volume
October 2020
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
8
Pages from-to
563-570
UT code for WoS article
000579804900076
EID of the result in the Scopus database
2-s2.0-85090410278