Approximating smallest enclosing balls with applications to machine learning

International Journal of Computational Geometry and Applications

Volumn 19, Issue 5, 2009, Pages 389-414

  Nielsen, Frank ^a,b   Nock, Richard ^c  

^a SONY COMPUTER SCIENCE LABORATORIES INC   (Japan)

^b ÉCOLE POLYTECHNIQUE   (France)

^c University of Antilles and Guyane   (France)

Author keywords

Coresets; Duality piercing covering; Smallest Euclidean enclosing ball

Indexed keywords

EID: 70350547720     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195909003039     Document Type: Conference Paper

References (51)

1. F. Nielsen and R. Nock, Approximating smallest enclosing balls, in Proc. Int. Conf. Computational Science and Its Applications (ICCSA), LNCS, Vol.3045 (Springer).
2. J. J. Sylvester, A question in the geometry of situation, Quart. J. Pure Appl. Math. 1 (1857) 79.
3. J. J. Sylvester, On Poncelet's approximate linear valuation of Surd forms, Philos. Mag. 20 (1860) 203-222.
4. The Collected Mathematical Papers of James Joseph Sylvester (American Mathemat- ical Society/Chelsea, 2007).
5. E. Welzl, Smallest enclosing disks (balls and ellipsoids), New Results and New Trends in Computer Science, ed. H. Maurer, LNCS (Springer, 1991).
6. R. Nock and F. Nielsen, Fitting the smallest enclosing Bregman ball, European Conf. Machine Learning, (2005), pp. 649-656.
7. M. B̧adoiu and K. L. Clarkson, Smaller core-sets for balls, Proc. 14th ACM-SIAM Symp. Discrete Algorithms, (2003), pp. 801-802.
8. R. Panigrahy, Minimum enclosing polytope in high dimensions, CoRR, cs.CG/0407020, 2004.
9. N. Megiddo, Linear programming in linear time when the dimension is fixed, J. ACM 31(1) (1984) 114-127.
10. N. Megiddo, On the ball spanned by balls, Discr. Comput. Geom. 4(6) (1989) 605-610.
11. K. Fischer and B. GÄartner, The smallest enclosing ball of balls: combinatorial structure and algorithms, Int. J. Comput. Geom. Appl. 14(4-5) (2004) 341-378.
12. B. GÄartner and E.Welzl, On a simple sampling lemma, Electronic Notes on Theoretical Computer Science, 31 2000.
13. B. GÄartner, A subexponential algorithm for abstract optimization problems, SIAM J. Comput. 24(5) (1995) 1018-1035.
14. B. GÄartner and E. Welzl, Explicit and implicit enforcing: Randomized optimization, Computational Discrete Mathematics, (2001), pp. 25-46.
15. T. Szabos, Unique sink orientations of cubes, FOCS '01: Proc. 42nd IEEE Symp. Foundations of Computer Science, IEEE Computer Society (Washington, DC, USA, 2001), p. 547.
16. B. Chazelle and J. Matou̧sek, On linear-time deterministic algorithms for optimization problems in fixed dimension, J. Algorith. 21(3) (1996) 579-597.
17. B. GÄartner, Fast and robust smallest enclosing balls, Proc. 7th European Symp. Algo- rithms, (1999), pp. 325-338.
18. K. Fischer, B. GÄartner and M. Kutz, Fast smallest-enclosing-ball computation in high dimensions, 11th Annual European Symp. (2003) pp. 630-641.
19. T. Hopp and C. Reeve, An algorithm for computing the minimum covering sphere in any dimension, NISTIR 5831 (1996).
20. P. Gritzmann and V. Klee, Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces, Math. Program. 59(2) (1993) 163-213.
21. J. Ritter, An effcient bounding sphere, Graphics gems (Academic Press Professional, Inc., 1990), pp. 301-303.
22. H. Zarrabi-Zadeh and T. Chan, A simple streaming algorithm for minimum enclosing balls, Proc. 18th Canadian Conf. Computational Geometry, (2006), pp. 139-142.
23. X. Wu, A linear-time simple bounding volume algorithms, Graphics Gems III (Aca- demic Press, 1992), pp. 301-306.
24. M. GrÄotschel, L. Lov¶asz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Vol.2, Second corrected edition edition (Springer, 1993).
25. B. GÄartner and S. Schonherr, An ecient, exact, and generic quadratic programming solver for geometric optimization, Proc. 16th Symp. Computational Geometry, (2000), pp. 110-118.
26. G. Zhou, J. Sun and K. C. Toh, Ecient algorithms for the smallest enclosing ball problem in high dimensional space, Technical report, AMS Fields Institute Commu- nications 37, 2003.
27. Y. E. Nesterov and M. J. Todd, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim. 8(2) (1998) 324-364.
28. M. B̧adoiu, S. Har-Peled and P. Indyk, Approximate clustering via core-sets, Proc. 34th ACM Symp. Theory of Computing, (2002), pp. 250-257.
29. P. Kumar, J. S. B. Mitchell and A. Yildirim, Computing core-sets and approximate smallest enclosing hyperspheres in high dimensions, in Algorithm Engineering and Experimentation, LNCS (Springer-Verlag, 2003), pp. 45-55.
30. P. K. Agarwal, S. Har-Peled and K. Varadarajan, Geometric approximation via core- sets, Combinatorial and Computational Geometry, eds. J. E. Goodman, J. Pach and E. Welzl (Math. Sci. Research Inst. Pub., Cambridge).
31. F. Nielsen, Visual Computing: Geometry, Graphics, and Vision (Charles River Media, 2005).
32. N. Alon, Y. Matias and M. Szegedy, The space complexity of approximating the frequency moments, J. Comput. Syst. Sci. 58(1) (1999) 137-147.
33. D. Avis and M. E. Houle, Computational aspects of Helly's theorem and its relatives, Int. J. Comput. Geom. Appl. 5(4) (1995) 357-367.
34. T. Hastie, R. Tibshirani and J. H. Friedman, The Elements of Statistical Learning (Springer, August 2001).
35. B. E. Boser, I. Guyon and V. Vapnik, A training algorithm for optimal margin clas- sifiers, Conf. Learning Theory, (1992). pp. 144-152.
36. N. Cristianini and J. Shawe-Taylor, An Introduction to Support Vector Machines and Other Kernel-based Learning Methods (Cambridge University Press, March 2000).
37. V. Vapnik and A. Lerner, Pattern recognition using generalized portrait method, Autom. Rem. Contr. 24 (1963).
38. M. Frank and P. Wolfe, An algorithm for quadratic programming. Naval Research Logistics Quart. 3 (1956) 95-110.
39. I. W. Tsang, J. T. Kwok and P.-M. Cheung, Core vector machines: Fast SVM training on very large data sets, J. Mach. Learn. Res. 6 (2005) 363-392.
40. I. W. Tsang, A. Kocsor and James T. Kwok, Simpler core vector machines with enclosing balls, Int. Conf. Machine Learning, 2007.
41. F. Nielsen and R. Nock, On approximating the smallest enclosing Bregman balls, in Proc. 22nd ACM Symp. Computational Geometry, (2006), pp. 485-486.
42. F. Nielsen and R. Nock, On the smallest enclosing information disk, Proc. 18th Cana- dian Conf. Computational Geometry, 2006, pp. 131-134.
43. I. Csiszar, Why least squares and maximum entropy? An axiomatic approach to in- ference for linear inverse problems, The Ann. Statist. 19(4) (1991) 2032-2066.
44. F. Nielsen, J.-D. Boissonnat and R. Nock, Bregman Voronoi diagrams: Properties, algorithms and applications, Technical Report RR-6154, INRIA, 2007; Extend ACM- SIAM Symp. Discrete Algorithms, (2007), pp. 746-755.
45. S. Guha, P. Indyk and A. McGregor, Sketching information divergences, ACM Com- putational Learning Theory, eds. N. H. Bshouty and C. Gentile, Vol.4539 (Springer, 2007), pp. 424-438.
46. S. ZÄurcher, Smallest enclosing ball for a point set with strictly convex level sets, March 2007. Master's thesis.
47. S. Skyum, A simple algorithm for computing the smallest enclosing circle, Inform. Process. Lett. 37(3) (1991) 121-125.
48. E. A. Yildirim, On the minimum volume covering ellipsoid of ellipsoids, SIAM J. Optim. 17(3) (2006) 621-641.
49. S. Schonherr, Quadratic Programming in Geometric Optimization: Theory, Implemen- tation and Applications, PhD thesis, 2002.
50. R. Brandenberg and L. Roth, Minimal containment under homothetics | A practical approach, Technical report, 2006, preprint.
51. K. L. Clarkson, Coresets, sparse greedy approximation, and the Frank-Wolfe algo- rithm, Technical report, IBM Almaden Research Center, 2007. Preprint, to appear in ACM-SIAM Symposium on Discrete Algorithms 2008.