arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1501.01320math.STmath.FAmath.OCstat.TH
收藏

利用$Γ$ -收敛性证明$k$ -均值极小化问题的收敛性

Convergence of the $k$-Means Minimization Problem using $Γ$-Convergence

Matthew Thorpe, Florian Theil, Adam M. Johansen, Neil Cade

摘要:

$k$均值方法是一种迭代聚类算法,它将每个观测与其中一个$k$聚类相关联。它传统上采用与观察数据相同的空间中的聚类中心。通过放宽这一要求,有可能将$k$ -均值方法应用于无穷维问题,例如存在未知数据关联的多目标跟踪和平滑问题。通过一个$Γ$收敛参数,相关的最优化问题收敛的意义上说,这两个$k$ -意味着最小和极小收敛的大数据限制的数量取决于所观察到的数据,只有通过其分布。该理论补充了两个例子,以证明现在访问的$k$ -手段方法的问题的范围。第一个例子结合了非参数平滑问题与未知数据关联。第二个地址使用来自被动传感器网络的稀疏数据进行跟踪。

英文摘要:

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 $Γ$-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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑