Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality

DOI10.1142/S0218195913600066zbMATH Open1300.68049OpenAlexW2107485210MaRDI QIDQ2875644FDOQ2875644

Authors: Amirali Abdullah, John Moeller, Suresh Venkatasubramanian 

Publication date: 11 August 2014

Published in: International Journal of Computational Geometry \& Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195913600066

Recommendations

• Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality
• A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds
• Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
• Matrix Nearness Problems with Bregman Divergences
• scientific article; zbMATH DE number 1775450

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Measures of information, entropy (94A17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• On Information and Sufficiency
• Sided and Symmetrized Bregman Centroids
• Bregman Voronoi diagrams
• I-divergence geometry of probability distributions and minimization problems
• Logistic regression, AdaBoost and Bregman distances
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• Approximate nearest neighbor queries revisited
• On the smallest enclosing information disk

Cited In (3)

• Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality
• A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds
• On proving 𝐶^{1,𝛼}_{𝑙𝑜𝑐}-estimates for convex functions

This page was built for publication: Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality

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