Approximate \(k\)-closest-pairs in large high-dimensional data sets

DOI10.1007/s10852-004-4080-3zbMath1084.68140MaRDI QIDQ814957

Fabrizio Angiulli, Clara Pizzuti

Publication date: 8 February 2006

Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10852-004-4080-3

zbMATH Keywords

approximation algorithms; Space Filling Curves

Mathematics Subject Classification ID

68W25: Approximation algorithms

Related Items

Distributed anomaly detection using 1‐class SVM for vertically partitioned data, Lie rough groups, Exploiting domain knowledge to detect outliers

Cites Work

• An optimal algorithm for the on-line closest-pair problem
• Space-filling curves
• Global optimization with non-convex constraints. Sequential and parallel algorithms
• Cure: An efficient clustering algorithm for large databases
• A simple randomized sieve algorithm for the closest-pair problem
• Sublinear time algorithms for metric space problems
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• FINDING k FARTHEST PAIRS AND k CLOSEST/FARTHEST BICHROMATIC PAIRS FOR POINTS IN THE PLANE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item