On the application of convex transforms to metric search
MetadataShow full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
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.
Connor , R , Dearle , A , Mic , V & Zezula , P 2020 , ' On the application of convex transforms to metric search ' , Pattern Recognition Letters , vol. 138 , pp. 563-570 . https://doi.org/10.1016/j.patrec.2020.08.008
Pattern Recognition Letters
Copyright © 2020 Elsevier B.V. All rights reserved. This work has been made available online in accordance with publisher policies or with permission. Permission for further reuse of this content should be sought from the publisher or the rights holder. This is the author created accepted manuscript following peer review and may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1016/j.patrec.2020.08.008.
DescriptionFunding: This research was supported by ERDF “CyberSecurity, CyberCrime and Critical Information Infrastructures Center of Excellence” (No.CZ.02.1.01/0.0/0.0/16 019/0000822) and by ESRC “Administrative Data Research Centres 2018” (No. ES/S007407/1).
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.