Abstract
The construction of r-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate r-nets with respect to Euclidean distance. For any fixed \(\epsilon >0\), the approximation factor is \(1+\epsilon\) and the complexity is polynomial in the dimension and subquadratic in the number of points; the algorithm succeeds with high probability. Specifically, we improve upon the best previously known (LSH-based) construction of Eppstein et al. (Approximate greedy clustering and distance selection for graph metrics, 2015. CoRR arxiv: abs/1507.01555) in terms of complexity, by reducing the dependence on \(\epsilon\), provided that \(\epsilon\) is sufficiently small. Moreover, our method does not require LSH but follows Valiant’s (J ACM 62(2):13, 2015. https://doi.org/10.1145/2728167) approach in designing a sequence of reductions of our problem to other problems in different spaces, under Euclidean distance or inner product, for which r-nets are computed efficiently and the error can be controlled. Our result immediately implies efficient solutions to a number of geometric problems in high dimension, such as finding the \((1+\epsilon )\)-approximate k-th nearest neighbor distance in time subquadratic in the size of the input.
Similar content being viewed by others
References
Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry, MSRI, pp. 1–30. University Press (2005)
Alman, J., Chan, T.M., Williams, R.: Polynomial representations of threshold functions and algorithmic application. In: Proceedings 57th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 467–476 (2016)
Anagnostopoulos, E., Emiris, I.Z., Psarros, I.: Low-quality dimension reduction and high-dimensional approximate nearest neighbor. CoRR arxiv: abs/1412.1683 (2014)
Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117–122 (2008). https://doi.org/10.1145/1327452.1327494
Avarikioti, G., Emiris, I.Z., Kavouras, L., Psarros, I.: High-dimensional approximate r-nets. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 16–30 (2017). https://doi.org/10.1137/1.9781611974782.2
Avarikioti, G., Ryser, A., Wang, Y., Wattenhofer, R.: High dimensional clustering with r-nets. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, pp. 3207–3214 (2019)
Charikar, M.: Similarity estimation techniques from rounding algorithms. In: Proceedings 34th Annual ACM Symposium on Theory of Computing, 2002, Montréal, Canada, pp. 380–388 (2002)
Coppersmith, D.: Rectangular matrix multiplication revisited. J. Complex. 13(1), 42–49 (1997). https://doi.org/10.1006/jcom.1997.0438
Dasgupta, S., Gupta, A.: An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms 22(1), 60–65 (2003). https://doi.org/10.1002/rsa.10073
Eppstein, D., Har-Peled, S., Sidiropoulos, A.: Approximate greedy clustering and distance selection for graph metrics. CoRR arxiv: abs/1507.01555 (2015)
Goel, A., Indyk, P., Varadarajan, K.: Reductions among high dimensional proximity problems. In: Proceedings 12th Symposium on Discrete Algorithms (SODA), pp. 769–778 (2001). http://dl.acm.org/citation.cfm?id=365411.365776. Accessed June 2016
Har-Peled, S.: Clustering motion. Discret. Comput. Geom. 31(4), 545–565 (2004). https://doi.org/10.1007/s00454-004-2822-7
Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics, and their applications. In: Proceedings 21st Annual Symposium Computational Geometry, pp. 150–158 (2005). https://doi.org/10.1145/1064092.1064117
Har-Peled, S., Raichel, B.: Net and prune: a linear time algorithm for euclidean distance problems. J. ACM 62(6), 44 (2015). https://doi.org/10.1145/2831230
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005). https://doi.org/10.1017/CBO9780511813603
Valiant, G.: Finding correlations in subquadratic time, with applications to learning parities and juntas. In: 53rd Annual IEEE Symposium Foundations of Computer Science (FOCS), pp. 11–20 (2012). https://doi.org/10.1109/FOCS.2012.27
Valiant, G.: Finding correlations in subquadratic time, with applications to learning parities and the closest pair problem. J. ACM 62(2), 13 (2015). https://doi.org/10.1145/2728167
Acknowledgements
I. Z. Emiris and I. Psarros acknowledges partial support by the European Union’s Horizon 2020 research and innovation programme under Grant agreement No. 734242 (RISE Project LAMBDA). I. Z. Emiris is member of Project-team AROMATH, a joint team between INRIA Sophia-Antipolis (France) and NKU Athens (Greece).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Avarikioti, Z., Emiris, I.Z., Kavouras, L. et al. High-Dimensional Approximate r-Nets. Algorithmica 82, 1675–1702 (2020). https://doi.org/10.1007/s00453-019-00664-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-019-00664-8