An efficient sum query algorithm for distance-based locally dominating functions

DOI10.1007/S00453-020-00691-WMaRDI QIDQ2196604zbMATH OpenOpenAlexFDO

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/

zbMATH Keywords

data structuredistance-based functionhigh dimensionslocal dominationsum query

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25)

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

• A unified framework for approximating and clustering data
• Approximate nearest neighbor: towards removing the curse of dimensionality
• Beyond locality-sensitive hashing
• Concentration inequalities. A nonasymptotic theory of independence
• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• Improved coresets for kernel density estimates
• On Approximating the Depth and Related Problems
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• On coresets for k-means and k-median clustering
• On Estimation of a Probability Density Function and Mode
• Optimal halfspace range reporting in three dimensions
• Probability Inequalities for Sums of Bounded Random Variables
• Sparse Approximation of a Kernel Mean

Cited in

(1)

• An efficient sum query algorithm for distance-based locally dominating functions

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)