Probabilistic smallest enclosing ball in high dimensions via subgradient sampling

DOI10.4230/LIPICS.SOCG.2019.47MaRDI QIDQ5088979zbMATH OpenOpenAlexFDO

Authors Amer Krivošija, Alexander Munteanu

Publication date 18 July 2022

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

zbMATH Keywords

convex optimizationgeometric mediankernel methodssupport vector data descriptionsmallest enclosing ballprobabilistic data

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On approximating the smallest enclosing Bregman Balls
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• Algorithms - ESA 2003
• scientific article; zbMATH DE number 1985309
• Smallest enclosing ball for probabilistic data
• An efficient algorithm for the smallest enclosing ball problem in high dimensions
• Approximate minimum enclosing balls in high dimensions using core-sets
• Subgradient Sampling for Nonsmooth Nonconvex Minimization
• Computational Science and Its Applications – ICCSA 2004
• Approximating Subdifferentials by Random Sampling of Gradients

Cites work

• scientific article; zbMATH DE number 2079414 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 3027356 (Why is no real title available?)
• A general purpose unequal probability sampling plan
• Approximate clustering via core-sets
• Clustering for metric and nonmetric distance measures
• Core vector machines: fast SVM training on very large data sets
• Distributed computing by mobile robots: gathering
• Gaussian processes for machine learning.
• Geometric median in nearly linear time
• Introductory lectures on convex optimization. A basic course.
• Linear-time approximation schemes for clustering problems in any dimensions
• On randomized one-round communication complexity
• On the point for which the sum of the distances to \(n\) given points is minimum
• Optimal core-sets for balls
• Quick k-Median, k-Center, and Facility Location for Sparse Graphs
• Reductions among high dimensional proximity problems
• Smallest enclosing ball for probabilistic data
• Stochastic \(k\)-center and \(j\)-flat-center problems
• Streaming algorithms for extent problems in high dimensions
• Support vector data description
• Weiszfeld's method: old and new results
• \(\varepsilon\)-kernel coresets for stochastic points

This page was built for publication: Probabilistic smallest enclosing ball in high dimensions via subgradient sampling

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