期刊
MACHINE LEARNING
卷 46, 期 1-3, 页码 11-19出版社
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1012485807823
关键词
metric multidimensional scaling; MDS; kernel PCA; eigenproblem
In this note we show that the kernel PCA algorithm of Scholkopf, Smola, and Muller (Neural Computation, 10, 1299-1319.) can be interpreted as a form of metric multidimensional scaling (MDS) when the kernel function k(x, y) is isotropic, i.e. it depends only on parallel tox - y parallel to. This leads to a metric MDS algorithm where the desired configuration of points is found via the solution of an eigenproblem rather than through the iterative optimization of the stress objective function. The question of kernel choice is also discussed.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据