You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Improved Pruning of Large Data Sets for the Minimum Enclosing Ball Problem

Research group:


Publication Type:

Journal article

Venue:

Graphical Models

Publisher:

Elsevier

DOI:

10.1016/j.gmod.2014.06.003


Abstract

Minimum enclosing ball algorithms are studied extensively as a tool in approximation and classification of multidimensional data. We present pruning techniques that can accelerate several existing algorithms by continuously removing interior points from the input. By recognizing a key property shared by these algorithms, we derive tighter bounds than have previously been presented, resulting in twice the effect on performance. Furthermore, only minor modifications are required to incorporate the pruning procedure. The presented bounds are independent of the dimension, and empirical evidence shows that the pruning procedure remains effective in dimensions up to at least 200. In some cases, performance improvements of two orders of magnitude are observed for large data sets.

Bibtex

@article{Kallberg3618,
author = {Linus K{\"a}llberg and Thomas Larsson},
title = {Improved Pruning of Large Data Sets for the Minimum Enclosing Ball Problem},
volume = {76},
number = {6},
pages = {609--619},
month = {July},
year = {2014},
journal = {Graphical Models},
publisher = {Elsevier},
url = {http://www.es.mdh.se/publications/3618-}
}