ANN for time series under the Fréchet distance

DOI10.1007/978-3-030-83508-8_23MaRDI QIDQ832871OpenAlexFDO

Authors Anne Driemel, Ioannis Psarros

Publication date 25 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-83508-8_23

zbMATH Keywords

data structuresapproximate nearest neighborFréchet distance

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 7236441 (Why is no real title available?)
• scientific article; zbMATH DE number 6469222 (Why is no real title available?)
• Algorithms for the discrete Fréchet distance under translation
• Approximability of the discrete Fréchet distance
• Approximate nearest neighbor algorithms for Frechet distance via product metrics
• Approximate nearest neighbor: towards removing the curse of dimensionality
• Clustering time series under the Fréchet distance
• Efficient nearest-neighbor query and clustering of planar curves
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Fast Fréchet queries
• Fast algorithms for approximate Fréchet matching queries in geometric trees
• Locality-sensitive hashing of curves
• Lower bounds for union-split-find related problems on random access machines
• On the complexity of range searching among curves
• Storing a Sparse Table with 0 (1) Worst Case Access Time
• The VC dimension of metric balls under Fréchet and Hausdorff distances

Cited in

(2)

• Approximate nearest neighbor for curves: simple, efficient, and deterministic
• On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions

This page was built for publication: ANN for time series under the Fréchet distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832871)