Learning from patches by efficient spectral decomposition of a structured kernel

DOI10.1007/s10994-015-5538-4zbMath1357.68183OpenAlexW2206661196WikidataQ110235270 ScholiaQ110235270MaRDI QIDQ285942

Amit Bermanis, Guy Wolf, Moshe Salhov, Amir Z. Averbuch

Publication date: 19 May 2016

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

Full work available at URL: https://doi.org/10.1007/s10994-015-5538-4

zbMATH Keywords

kernel methodmanifold learningdiffusion mapshigh-dimensional data analysisnon-scalar similarityout-of-sample extensionvector field interpolation

Mathematics Subject Classification ID

Directional data; spatial statistics (62H11) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchical data organization, clustering and denoising via localized diffusion folders
• Patch-to-tensor embedding
• Orientability and diffusion maps
• Non-linear independent component analysis with diffusion maps
• Matrix computations.
• Linear-projection diffusion on smooth Euclidean submanifolds
• Multiscale data sampling and function extension
• Diffusion maps
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Vector diffusion maps and the connection Laplacian
• Stability and Error Estimates for Vector Field Interpolation and Decomposition on the Sphere with RBFs
• Filling-in by joint interpolation of vector fields and gray levels
• Audio-Visual Group Recognition Using Diffusion Maps
• Parametrization of Linear Systems Using Diffusion Kernels
• Lanczos Algorithms for Large Symmetric Eigenvalue Computations
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• A New Backpropagation Learning Algorithm for Layered Neural Networks with Nondifferentiable Units
• The Kernel Recursive Least-Squares Algorithm

This page was built for publication: Learning from patches by efficient spectral decomposition of a structured kernel