Decomposable algorithms for nearest neighbor computing

DOI10.1016/J.JPDC.2007.12.005MaRDI QIDQ436812zbMATH OpenOpenAlexFDO

Authors Ahmed M. Khedr, Ahmed Salim

Publication date 26 July 2012

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2007.12.005

zbMATH Keywords

nearest neighbormobile agentsdecomposable algorithmsdistributed databasesnearest pairstationary agentsvertically and horizontally partitioned

Mathematics Subject Classification ID

Database theory (68P15) Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 6699826
• Data and Applications Security XIX
• Privacy Preserving Unsupervised Clustering over Vertically Partitioned Data
• Learning \(k\)-nearest neighbors classifier from distributed data
• Incorporating Privacy Concerns in Data Mining on Distributed Data

Cites work

• scientific article; zbMATH DE number 1003290 (Why is no real title available?)
• scientific article; zbMATH DE number 437552 (Why is no real title available?)
• scientific article; zbMATH DE number 3436645 (Why is no real title available?)
• scientific article; zbMATH DE number 1559575 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• scientific article; zbMATH DE number 1775451 (Why is no real title available?)
• scientific article; zbMATH DE number 3806754 (Why is no real title available?)
• scientific article; zbMATH DE number 1893569 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Agents for integrating distributed data for complex computations
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Approximate closest-point queries in high dimensions
• Distributed Computing - IWDC 2003
• Learning \(k\)-nearest neighbors classifier from distributed data

Cited in

(4)

• Secure approximate nearest neighbor search with locality-sensitive hashing
• scientific article; zbMATH DE number 7051199 (Why is no real title available?)
• Deferred data structure for the nearest neighbor problem
• Fast spatial decomposition and closest pair computation for limited precision input

This page was built for publication: Decomposable algorithms for nearest neighbor computing

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