Plug-and-play dual-tree algorithm runtime analysis

MaRDI QIDQ2788409zbMATH OpenFDO

Authors Ryan R. Curtin, Dongryeol Lee, William B. March, Parikshit Ram

Publication date 19 February 2016

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.05222, http://jmlr.csail.mit.edu/papers/v16/curtin15a.html

zbMATH Keywords

adaptive runtime analysiscover treedual-tree algorithmsexpansion constantkernel density estimationnearest neighbor searchrange search

Mathematics Subject Classification ID

Density estimation (62G07) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Fast kernel conditional density estimation: a dual-tree Monte Carlo approach
• Searching Trees: An Essay
• Algorithms for optimal dyadic decision trees
• Analysis of range search for random \(k-d\) trees
• scientific article; zbMATH DE number 6378173

Cited in

(3)

• Runtime guarantees for regression problems
• Approximating the directed Hausdorff distance
• Execution time analysis of a top-down R-tree construction algorithm

Describes a project that uses

Uses Software

• MLPACK
• MNIST
• UCI

This page was built for publication: Plug-and-play dual-tree algorithm runtime analysis

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