ScholarGate
Asistente

Comparar métodos

Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.

Análisis de Componentes Independientes (ICA)×PCA con kernel×Descomposición en Valores Singulares×
CampoAprendizaje automáticoAprendizaje automáticoMétodos numéricos
FamiliaLatent structureLatent structureMachine learning
Año de origen199419981965
Autor originalComon, P.Schölkopf, B.; Smola, A. J.; Müller, K.-R.Gene Golub
TipoBlind source separation / latent-structure decompositionNonlinear dimensionality reduction via kernel trickLinear algebra decomposition
Fuente seminalComon, 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 ↗
AliasICA, blind source separation, BSS, FastICAKPCA, kernel PCA, nonlinear PCA via kernel trick, kernel eigenvalue decompositionSVD, thin SVD, reduced SVD
Relacionados350
ResumenIndependent 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.
ScholarGateConjunto de datos
  1. v1
  2. 2 Fuentes
  3. PUBLISHED
  1. v1
  2. 3 Fuentes
  3. PUBLISHED
  1. v1
  2. 3 Fuentes
  3. PUBLISHED

Ir a la búsqueda Descargar diapositivas

ScholarGateComparar métodos: Independent Component Analysis · Kernel PCA · Singular Value Decomposition. Recuperado el 2026-06-18 de https://scholargate.app/es/compare