Dual‐tree fast exact max‐kernel search

DOI10.1002/sam.11218OpenAlexW1591023622MaRDI QIDQ4969941

Ryan 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-boundkernel tricksimilarity searchdual-tree algorithmscover trees

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• UCI-ml
• MLPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Satisfying general proximity/similarity queries with metric trees
• Nearest neighbor queries in metric spaces
• Quad trees: A data structure for retrieval by composite keys
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Similarity estimation techniques from rounding algorithms
• Finding nearest neighbors in growth-restricted metrics
• Multidimensional binary search trees used for associative searching
• A Branch and Bound Algorithm for Computing k-Nearest Neighbors
• A Branch and Bound Clustering Algorithm
• A Branch and Bound Algorithm for Feature Subset Selection
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces

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