ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

奇异谱分析×核主成分分析×奇异值分解×
领域时间序列机器学习数值方法
方法族Process / pipelineLatent structureMachine learning
起源年份198619981965
提出者David BroomheadSchölkopf, B.; Smola, A. J.; Müller, K.-R.Gene Golub
类型Dimension reduction and trend extractionNonlinear dimensionality reduction via kernel trickLinear algebra decomposition
开创性文献Broomhead, D. S., & King, G. P. (1986). Extracting qualitative dynamics from experimental data. Physica D: Nonlinear Phenomena, 20(2–3), 217–236. DOI ↗Schölkopf, B., Smola, A. J., & Müller, K.-R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5), 1299–1319. DOI ↗Golub, G. H., & Kahan, W. (1970). Calculating the singular values and pseudo-inverse of a matrix. Journal of the SIAM Series B: Numerical Analysis, 2(2), 205–224. DOI ↗
别名SSA, SVD-based decompositionKPCA, kernel PCA, nonlinear PCA via kernel trick, kernel eigenvalue decompositionSVD, thin SVD, reduced SVD
相关350
摘要Singular Spectrum Analysis (SSA) is a nonparametric method for time-series decomposition and forecasting based on singular value decomposition (SVD) of a time-lagged embedding matrix. Introduced by Broomhead and King (1986) and developed further by Vautard, Yiou, and Ghil (1992), SSA decomposes time series into trend, oscillatory, and noise components without assuming any underlying model. It is particularly effective for short, noisy non-stationary signals where parametric approaches fail.Kernel Principal Component Analysis (Kernel PCA) is a nonlinear dimensionality-reduction method introduced by Bernhard Schölkopf, Alexander Smola, and Klaus-Robert Müller in 1997–1998. It extends classical linear PCA to curved, non-linear data manifolds by implicitly mapping input data into a high-dimensional feature space via a kernel function, then performing standard PCA in that space — all without ever computing the mapping explicitly.Singular Value Decomposition (SVD) is a fundamental matrix factorization technique that decomposes any m × n matrix A into the product A = U Σ V^T, where U and V are orthogonal matrices and Σ is a diagonal matrix of singular values. Developed by Gene Golub and others in the 1960s–1970s, SVD is the most robust method for analyzing matrix structure and solving linear systems.
ScholarGate数据集
  1. v1
  2. 3 来源
  3. PUBLISHED
  1. v1
  2. 3 来源
  3. PUBLISHED
  1. v1
  2. 3 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Singular Spectrum Analysis · Kernel PCA · Singular Value Decomposition. 于 2026-06-18 检索自 https://scholargate.app/zh/compare