Abstract
In a metric space, triangle inequality implies that, for any three objects, a triangle with edge lengths corresponding to their pairwise distances can be formed. The n-point property is a generalisation of this where, for any \((n+1)\) objects in the space, there exists an n-dimensional simplex whose edge lengths correspond to the distances among the objects. In general, metric spaces do not have this property; however in 1953, Blumenthal showed that any semi-metric space which is isometrically embeddable in a Hilbert space also has the n-point property.
We have previously called such spaces supermetric spaces, and have shown that many metric spaces are also supermetric, including Euclidean, Cosine, Jensen-Shannon and Triangular spaces of any dimension.
Here we show how such simplexes can be constructed from only their edge lengths, and we show how the geometry of the simplexes can be used to determine lower and upper bounds on unknown distances within the original space. By increasing the number of dimensions, these bounds converge to the true distance.
Finally we show that for any Hilbert-embeddable space, it is possible to construct Euclidean spaces of arbitrary dimensions, from which these lower and upper bounds of the original space can be determined. These spaces may be much cheaper to query than the original. For similarity search, the engineering tradeoffs are good: we show significant reductions in data size and metric cost with little loss of accuracy, leading to a significant overall improvement in exact search performance.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In [9] the authors note it works better for some metrics than for others; in our understanding, it will work well only for spaces with the n-point property.
- 2.
For precise definitions of the non-Euclidean metrics used, see [5].
- 3.
https://richardconnor@bitbucket.org/richardconnor/metric-space-framework.git.
References
Blumenthal, L.M.: A note on the four-point property. Bull. Amer. Math. Soc. 39(6), 423–426 (1933)
Blumenthal, L.M.: Theory and Applications of Distance Geometry. Clarendon Press, London (1953)
Chávez, E., Navarro, G.: Metric databases. In: Rivero, L.C., Doorn, J.H., Ferraggine, V.E. (eds.) Encyclopedia of Database Technologies and Applications, pp. 366–371. Idea Group (2005)
Chávez, E., Navarro, G., Baeza-Yates, R., Marroquín, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273–321 (2001)
Connor, R., Cardillo, F.A., Vadicamo, L., Rabitti, F.: Hilbert exclusion: improved metric search through finite isometric embeddings. ACM Trans. Inform. Syst. 35(3), 17:1–17:27 (2016)
Connor, R., Vadicamo, L., Rabitti, F.: High-Dimensional Simplexes for Supermetric Search. arXiv e-prints, July 2017
Connor, R.: A tale of four metrics. In: Amsaleg, L., Houle, M.E., Schubert, E. (eds.) SISAP 2016. LNCS, vol. 9939, pp. 210–217. Springer, Cham (2016). doi:10.1007/978-3-319-46759-7_16
Cox, M.A.A., Cox, T.F.: Multidimensional Scaling. Springer, Heidelberg (2008). pp. 315–347
De Silva, V., Tenenbaum, J.B.: Sparse multidimensional scaling using landmark points. Technical report (2004)
Figueroa, K., Navarro, G., Chávez, E.: Metric spaces library (2007). http://www.sisap.org
Fodor, I.K.: A survey of dimension reduction techniques. Technical report, Center for Applied Scientific Computing, Lawrence Livermore National Laboratory (2002)
Jolliffe, I.: Principal Component Analysis. Wiley, New York (2014)
Mao, R., Miranker, W.L., Miranker, D.P.: Dimension reduction for distance-based indexing. In: SISAP 2010, pp. 25–32. ACM (2010)
Matoušek, J.: Lectures on Discrete Geometry, Graduate Texts in Mathematics. Springer, New York (2013)
Menger, K.: Untersuchungen ber allgemeine metrik. Math. Ann. 100, 75–163 (1928)
Micó, M.L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Patt. Recogn. Lett. 15(1), 9–17 (1994)
Wilson, W.A.: A relation between metric and euclidean spaces. Am. J. Math. 54(3), 505–517 (1932)
Yang, L.: Distance Metric Learning: A Comprehensive Survey (2006)
Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Advances in Database Systems, vol. 32. Springer, Heidelberg (2006)
Acknowledgements
The work was partially funded by Smart News, “Social sensing for breaking news”, co-funded by the Tuscany region under the FAR-FAS 2014 program, CUP CIPE D58C15000270008.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Connor, R., Vadicamo, L., Rabitti, F. (2017). High-Dimensional Simplexes for Supermetric Search. In: Beecks, C., Borutta, F., Kröger, P., Seidl, T. (eds) Similarity Search and Applications. SISAP 2017. Lecture Notes in Computer Science(), vol 10609. Springer, Cham. https://doi.org/10.1007/978-3-319-68474-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-68474-1_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-68473-4
Online ISBN: 978-3-319-68474-1
eBook Packages: Computer ScienceComputer Science (R0)