Near-optimal coresets of kernel density estimates

DOI10.4230/LIPICS.SOCG.2018.66MaRDI QIDQ5116526zbMATH OpenFDO

Authors Jeff M. Phillips, Wai Ming Tai

Publication date 18 August 2020

zbMATH Keywords

discrepancykernel density estimatecoresets

Mathematics Subject Classification ID

Nonparametric estimation (62G05) Density estimation (62G07) Asymptotic properties of nonparametric inference (62G20) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Near-optimal coresets of kernel density estimates
• Improved coresets for kernel density estimates
• scientific article; zbMATH DE number 7164768
• Coresets for polytope distance
• \(\varepsilon\)-kernel coresets for stochastic points

Cites work

• scientific article; zbMATH DE number 3870398 (Why is no real title available?)
• scientific article; zbMATH DE number 1528185 (Why is no real title available?)
• scientific article; zbMATH DE number 1380581 (Why is no real title available?)
• scientific article; zbMATH DE number 4001209 (Why is no real title available?)
• scientific article; zbMATH DE number 837911 (Why is no real title available?)
• A kernel two-sample test
• Algorithms for ε-Approximations of Terrains
• Comparing distributions and shapes using the kernel distance
• Confidence sets for persistence diagrams
• Decomposable searching problems I. Static-to-dynamic transformation
• Factorization norms and hereditary discrepancy
• Generalized density clustering
• Geometric discrepancy. An illustrated guide
• Geometric inference on kernel density estimates
• Hilbert space embeddings and metrics on probability measures
• Improved coresets for kernel density estimates
• Kernel methods in machine learning
• Local outlier detection reconsidered: a generalized view on locality with applications to spatial, video, and network outlier detection
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• On the Nyström method for approximating a gram matrix for improved kernel-based learning
• On the estimation of the gradient lines of a density and the consistency of the mean-shift algorithm
• The Gram-Schmidt walk: a cure for the Banaszczyk blues
• Topological consistency via kernel estimation
• \(\varepsilon\)-samples for kernels

Cited in

(5)

• Improved coresets for kernel density estimates
• \(\varepsilon\)-samples for kernels
• Near-optimal coresets of kernel density estimates
• Coresets for polytope distance
• Optimal coreset for Gaussian kernel density estimation

This page was built for publication: Near-optimal coresets of kernel density estimates

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