mdh.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Improved pruning of large data sets for the minimum enclosing ball problem
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0002-6969-6793
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system.ORCID-id: 0000-0002-1550-0994
2014 (engelsk)Inngår i: Graphical Models, ISSN 1524-0703, E-ISSN 1524-0711, Vol. 76, nr 6, s. 609-619Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

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. © 2014 Elsevier Inc. All rights reserved.

sted, utgiver, år, opplag, sider
2014. Vol. 76, nr 6, s. 609-619
Emneord [en]
Acceleration techniques, Bounding spheres, Culling, Minimum enclosing balls, Pruning
HSV kategori
Identifikatorer
URN: urn:nbn:se:mdh:diva-25799DOI: 10.1016/j.gmod.2014.06.003ISI: 000347018500050Scopus ID: 2-s2.0-84905501009OAI: oai:DiVA.org:mdh-25799DiVA, id: diva2:739144
Tilgjengelig fra: 2014-08-20 Laget: 2014-08-20 Sist oppdatert: 2018-02-23bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Källberg, LinusLarsson, Thomas B

Søk i DiVA

Av forfatter/redaktør
Källberg, LinusLarsson, Thomas B
Av organisasjonen
I samme tidsskrift
Graphical Models

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 144 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf