APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING

DOI10.1142/S0218195909003039zbMath1192.65026MaRDI QIDQ3647614

Richard Nock, Frank Nielsen

Publication date: 23 November 2009

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmscomputational geometrymachine learningcoresetsduality piercing/coveringsmallest Euclidean enclosing ball

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (15)

The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems ⋮ An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions ⋮ The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions ⋮ A branch-and-bound method for the minimum \(k\)-enclosing ball problem ⋮ A hybrid algorithm for the minimum bounding sphere problem ⋮ Minimal time functions and the smallest intersecting ball problem with unbounded dynamics ⋮ A proximal method for solving nonlinear minmax location problems with perturbed minimal time functions via conjugate duality ⋮ Averaging Symmetric Positive-Definite Matrices ⋮ Geometric Matrix Midranges ⋮ Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography ⋮ Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls ⋮ On a minimum enclosing ball of a collection of linear subspaces ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices ⋮ Solving \(k\)-center problems involving sets based on optimization techniques

Uses Software

• Miniball

Cites Work

• A simple algorithm for computing the smallest enclosing circle
• Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
• On the ball spanned by balls
• The space complexity of approximating the frequency moments
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• Linear Programming in Linear Time When the Dimension Is Fixed
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• A Subexponential Algorithm for Abstract Optimization Problems
• COMPUTATIONAL ASPECTS OF HELLY’S THEOREM AND ITS RELATIVES
• On the Minimum Volume Covering Ellipsoid of Ellipsoids

This page was built for publication: APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING