Constructing a High-Dimensional k NN-Graph Using a Z-Order Curve

DOI10.1145/3274656OpenAlexW2896407870MaRDI QIDQ4629532

Sami Sieranoja, Pasi Fränti

Publication date: 27 March 2019

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3274656

zbMATH Keywords

nearest neighborspace-filling curvesgraph constructionkNN-graphneighborhood propagationZ-order curve

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

NN-EVCLUS: neural network-based evidential clustering ⋮ Mixed-integer programming techniques for the minimum sum-of-squares clustering problem ⋮ Cross-study replicability in cluster analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative shrinking method for clustering problems
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Error analysis and simulation for APMI
• Converting to and from Dilated Integers
• An effective way to represent quadtrees
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors

This page was built for publication: Constructing a High-Dimensional k NN-Graph Using a Z-Order Curve