Corporate Website
Contatti
en
Technology Transfer
Chi siamo
Brevetti
Pubblicazioni
News
Cerca
it
Created with Sketch.
Chiudi menu
English
italiano
Back
en
Chiudi menu
Chi siamo
Brevetti
Pubblicazioni
News
Corporate Website
Contatti
Lista pubblicazioni
Visualizza PUB_LIST
Versione:
1.0
Approvato
it-IT
it-IT
en-US
LDO-ID
2014-06-27-08
Titolo
Convergence of the k-Means Minimization Problem using G-Convergence
Abstract
The k-means method is an iterative clustering algorithm which associates each observation with one of k clusters. It traditionally employs cluster centers in the same space as the observed data. By relaxing this requirement, it is possible to apply the k-means method to infinite dimensional problems, for example multiple target tracking and smoothing problems in the presence of unknown data association. Via a G-convergence argument, the associated optimization problem is shown to converge in the sense that both the k-means minimum and minimizers converge in the large data limit to quantities which depend upon the observed data only through its distribution. The theory is supplemented with two examples to demonstrate the range of problems now accessible by the k-means method. The first example combines a non-parametric smoothing problem with unknown data association. The second addresses tracking using sparse data from a network of passive sensors.
Autori
Matthew Thorpe, Florian Theil, Adam M. Johansen, Neil Cade
Tipologia
Paper for Specialistic Magazine
Media
SIAM Journal on Applied Mathematics
Sito web
Anno
2014
Annulla
popup-close
Previous
Next
popup-close
popup-close
Close page
Inserisci il testo di ricerca
popup-close
LinkedIn
Twitter
Facebook
This application needs JavaScript to be enabled
2024-11-06T20:49:55Z
cookie_disclaimer:true
page_disclaimer :false