Matrix-based Kernel Principal Component analysis for large-scale data set
IJCNN(2009)
摘要
Kernel Principal Component Analysis (KPCA) is a nonlinear feature extraction approach, which generally needs to eigen-decompose the kernel matrix. But the size of kernel matrix scales with the number of data points, it is infeasible to store and compute the kernel matrix when faced with the large-scale data set. To overcome computational and storage problem for large-scale data set, a new framework, Matrixbased Kernel Principal Component Analysis (M-KPCA), is proposed. By dividing the large scale data set into small subsets, we could treat the autocorrelation matrix of each subset as the special computational unit. A novel polynomial-matrix kernel function is adopted to compute the similarity between the data matrices in place of vectors. It is also proved that the polynomial kernel is the extreme case of the polynomial-matrix one. The proposed M-KPCA can greatly reduce the size of kernel matrix, which makes its computation possible. The effectiveness is demonstrated by the experimental results on the artificial and real data set.
更多查看译文
关键词
eigen-decompose,large-scale data,kernel matrix scale,nonlinear feature extraction,matrix-based kernel principal component,large scale data,novel polynomial-matrix kernel function,polynomial kernel,feature extraction,data point,large-scale data set,component analysis,polynomial-matrix kernel function,principal component analysis,polynomial matrices,kernel principal component analysis,data matrix,kernel matrix,autocorrelation,polynomial matrix,correlation,polynomials,kernel,kernel function,sampling methods,neural networks,covariance matrix,data mining
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络