An efficient sum query algorithm for distance-based locally dominating functions
From MaRDI portal
Publication:2196604
DOI10.1007/S00453-020-00691-WzbMATH Open1453.68063OpenAlexW3010140249MaRDI QIDQ2196604FDOQ2196604
Authors: Ziyun Huang, Jinhui Xu 
Publication date: 3 September 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8248/
Recommendations
- An efficient sum query algorithm for distance-based locally dominating functions
- Fast, precise and dynamic distance queries
- Fast approximations for sums of distances, clustering and the Fermat-Weber problem
- Approximate Distance Queries in Disk Graphs
- On top-\(k\) weighted sum aggregate nearest and farthest neighbors in the \(L_1\) plane
Cites Work
- Concentration inequalities. A nonasymptotic theory of independence
- Probability Inequalities for Sums of Bounded Random Variables
- On Estimation of a Probability Density Function and Mode
- Approximate nearest neighbor: towards removing the curse of dimensionality
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Title not available (Why is that?)
- On coresets for k-means and k-median clustering
- On Approximating the Depth and Related Problems
- Title not available (Why is that?)
- A unified framework for approximating and clustering data
- Beyond Locality-Sensitive Hashing
- Title not available (Why is that?)
- Sparse Approximation of a Kernel Mean
Cited In (1)
This page was built for publication: An efficient sum query algorithm for distance-based locally dominating functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196604)
