Dual‐tree fast exact max‐kernel search

DOI10.1002/SAM.11218MaRDI QIDQ4969941zbMATH OpenOpenAlexFDO

Authors Ryan R. Curtin, Parikshit Ram

Publication date 14 October 2020

Published in Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/sam.11218

zbMATH Keywords

branch-and-boundcover treesdual-tree algorithmskernel tricksimilarity search

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Cites work

• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• A Branch and Bound Algorithm for Feature Subset Selection
• A Branch and Bound Clustering Algorithm
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
• Finding nearest neighbors in growth-restricted metrics
• scientific article; zbMATH DE number 437556 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 5485566 (Why is no real title available?)
• scientific article; zbMATH DE number 6276253 (Why is no real title available?)
• scientific article; zbMATH DE number 6469222 (Why is no real title available?)
• Multidimensional binary search trees used for associative searching
• Nearest neighbor queries in metric spaces
• Quad trees: A data structure for retrieval by composite keys
• Satisfying general proximity/similarity queries with metric trees
• Similarity estimation techniques from rounding algorithms

Cited in

(1)

• Improved maximum inner product search with better theoretical guarantee using randomized partition trees

Describes a project that uses

Uses Software

• UCI
• MLPACK

This page was built for publication: Dual‐tree fast exact max‐kernel search

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