On a connection between kernel PCA and metric multidimensional scaling

DOI10.1023/A:1012485807823zbMath1052.68118OpenAlexW1587720067MaRDI QIDQ5959952

Christopher K. I. Williams

Publication date: 11 April 2002

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1012485807823

zbMATH Keywords

kernel choice

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (12)

Estimating the city-block two-dimensional scaling model with simulated annealing ⋮ Trace optimization and eigenproblems in dimension reduction methods ⋮ Dimension reduction and construction of feature space for image pattern recognition ⋮ Forward Stepwise Deep Autoencoder-Based Monotone Nonlinear Dimensionality Reduction Methods ⋮ Robust kernel Isomap ⋮ A flow-based pattern recognition algorithm for rapid quantification of geologic uncertainty ⋮ Manifold learning for the emulation of spatial fields from computational models ⋮ Nonlinear dimensionality reduction by topologically constrained isometric embedding ⋮ Kernel principal component analysis for stochastic input model generation ⋮ SVDD-Based Pattern Denoising ⋮ Continuum isomap for manifold learnings ⋮ On the Schoenberg transformations in data analysis: theory and illustrations

This page was built for publication: On a connection between kernel PCA and metric multidimensional scaling