On geometric prototype and applications

DOI10.4230/LIPICS.ESA.2018.23MaRDI QIDQ5009580zbMATH OpenOpenAlexFDO

Authors Hu Ding, Manni Liu

Publication date 4 August 2021

Full work available at URL https://arxiv.org/abs/1804.09655

zbMATH Keywords

core-setensemble clusteringprototypeWasserstein barycenter

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Geometric optimization revisited
• Algorithms – ESA 2005
• A unified framework for approximating and clustering data
• On approximate geometric \(k\)-clustering
• Projective clustering in high dimensions using core-sets

Cites work

• A near-linear constant-factor approximation for Euclidean bipartite matching?
• A near-linear time ε-approximation algorithm for geometric bipartite matching
• A unified framework for approximating and clustering data
• A unified framework for clustering constrained data without locality property
• Algorithms for the transportation problem in geometric settings
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Bichromatic 2-center of pairs of points
• Database-friendly random projections: Johnson-Lindenstrauss with binary coins.
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Ensemble clustering using semidefinite programming with applications
• Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
• Faster algorithms for the geometric transportation problem
• Geometric median in nearly linear time
• scientific article; zbMATH DE number 6381629 (Why is no real title available?)
• scientific article; zbMATH DE number 5019895 (Why is no real title available?)
• scientific article; zbMATH DE number 7053357 (Why is no real title available?)
• Introduction to algorithms.
• Iterative Bregman projections for regularized transportation problems
• Least squares quantization in PCM
• Matching point sets with respect to the earth mover's distance
• Network flows. Theory, algorithms, and applications.
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• On the approximation of correlation clustering and consensus clustering
• Parallel algorithms for geometric graph problems
• Solving the chromatic cone clustering problem via minimum spanning sphere
• The earth mover's distance as a metric for image retrieval
• The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
• The Mailman algorithm: a note on matrix-vector multiplication
• Universal \({\epsilon}\)-approximators for integrals

Describes a project that uses

Uses Software

• EMD

This page was built for publication: On geometric prototype and applications

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