所有作者：王海贤
作者单位：东南大学学习科学研究中心
论文摘要：Kernel principal component analysis (KPCA)， as a nonlinear extension to PCA via kernel trick， has received great attention for its extreme usefulness in nonlinear feature extraction and many applications。 However， a major drawback of the standard KPCA is that the amount of computation required is of cubic growth with the number of training data points， say $n$， and the space needed to store the kernel matrix is of $n$ square。 In this paper， viewing KPCA as a primal space problem with the "samples" created by using incomplete Cholesky decomposition， we show that KPCA is equivalent to performing linear PCA in the primal space using the created "samples"。 Thus， all the efficient algorithms for PCA can be straightforwardly transformed into KPCA。 Particularly， whereas KPCA defines only a global projection of the samples， we extend KPCA to a mixture of local KPCA models by applying the mixture model to probabilistic PCA in the primal space。 The theoretical analysis and experimental results on both artificial and real data set have shown the superiority of the proposed methods in terms of computational efficiency and storage space， as well as recognition rate， especially when the number of data points $n$ is large。
关键词： Kernel principal component analysis (KPCA) incomplete Cholesky decomposition primal space mixtures o
免费下载《From Feature Space to Primal Space: KPCA and Its Mixture Model》PDF全文（已停止下载）
本站“论文下载”文章收集整理于“中国科技论文在线”，由于各种原因，本站已暂停论文下载！请前往“中国科技论文在线http://www.paper.edu.cn/”免费下载！
指出，范文大全立刻进行改正或删除有关内容! 
当前位置：