ScholarGate
Asistents

Salīdzināt metodes

Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.

Neatkarīgo komponentu analīze (ICA)×Kodola PCA×Singular Value Decomposition×
NozareMašīnmācīšanāsMašīnmācīšanāsSkaitliskās metodes
SaimeLatent structureLatent structureMachine learning
Izcelsmes gads199419981965
AutorsComon, P.Schölkopf, B.; Smola, A. J.; Müller, K.-R.Gene Golub
TipsBlind source separation / latent-structure decompositionNonlinear dimensionality reduction via kernel trickLinear algebra decomposition
PirmavotsComon, P. (1994). Independent component analysis, a new concept? Signal Processing, 36(3), 287–314. 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 ↗
Citi nosaukumiICA, blind source separation, BSS, FastICAKPCA, kernel PCA, nonlinear PCA via kernel trick, kernel eigenvalue decompositionSVD, thin SVD, reduced SVD
Saistītās350
KopsavilkumsIndependent Component Analysis (ICA) is a computational method for separating a multivariate signal into additive, statistically independent subcomponents. Formalized by Pierre Comon in 1994, ICA became the foundational framework for blind source separation and is widely applied in neuroimaging (fMRI, EEG), speech processing, and biomedical signal analysis.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.
ScholarGateDatu kopa
  1. v1
  2. 2 Avoti
  3. PUBLISHED
  1. v1
  2. 3 Avoti
  3. PUBLISHED
  1. v1
  2. 3 Avoti
  3. PUBLISHED

Doties uz meklēšanu Lejupielādēt slaidus

ScholarGateSalīdzināt metodes: Independent Component Analysis · Kernel PCA · Singular Value Decomposition. Izgūts 2026-06-18 no https://scholargate.app/lv/compare