Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
From MaRDI portal
(Redirected from Publication:4816852)
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- A new algorithm of non-Gaussian component analysis with radial kernel functions
- A comprehensive survey on deep graph representation learning methods
- Complex systems: features, similarity and connectivity
- Conceptual and empirical comparison of dimensionality reduction algorithms (PCA, KPCA, LDA, MDS, SVD, LLE, ISOMAP, LE, ICA, t-SNE)
- Eigen-convergence of Gaussian kernelized graph Laplacian by manifold heat interpolation
- Similarity, kernels, and the fundamental constraints on cognition
- The homotopy significant spectrum compared to the Krasnoselskii spectrum
- Manifold learning with arbitrary norms
- An extended shift-invert residual Arnoldi method
- Functional architecture of M1 cells encoding movement direction
- A Distance-Preserving Matrix Sketch
- Doubly stochastic normalization of the Gaussian kernel is robust to heteroskedastic noise
- Discriminant subspace learning constrained by locally statistical uncorrelation for face recognition
- Density estimation on manifolds with boundary
- Neurons on amoebae
- A joint learning framework for optimal feature extraction and multi-class SVM
- Delay-coordinate maps and the spectra of Koopman operators
- Data-driven spectral decomposition and forecasting of ergodic dynamical systems
- Spectrum of large random inner-product kernel matrices generated from lp ellipsoids
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- A natural diffusion distance and equivalence of local convergence and local equicontinuity for a general symmetric diffusion semigroup
- Spectral clustering via sparse graph structure learning with application to proteomic signaling networks in cancer
- Adapted single-cell consensus clustering (adaSC3)
- On two continuum armed bandit problems in high dimensions
- A filtering technique for Markov chains with applications to spectral embedding
- A fast algorithm for manifold learning by posing it as a symmetric diagonally dominant linear system
- Local kernels and the geometric structure of data
- A multilevel approach for learning from labeled and unlabeled data on graphs
- Nonlinear embedding preserving multiple local-linearities
- Graph embedding using tree edit-union
- Quantum algorithm for Laplacian eigenmap via Rayleigh quotient iteration
- Semi-parametric Bayes regression with network-valued covariates
- Data-driven efficient solvers for Langevin dynamics on manifold in high dimensions
- Harmonic analysis on directed graphs and applications: from Fourier analysis to wavelets
- A tractable latent variable model for nonlinear dimensionality reduction
- Natural graph wavelet packet dictionaries
- Embedding tangent space extreme learning machine for EEG decoding in brain computer interface systems
- Topological analysis of syntactic structures
- scientific article; zbMATH DE number 7306882 (Why is no real title available?)
- Unsupervised learning using the tensor voting graph
- Invertibility of graph translation and support of Laplacian Fiedler vectors
- Graph similarity through entropic manifold alignment
- Approximation of functions over manifolds: a moving least-squares approach
- Cross-validation of matching correlation analysis by resampling matching weights
- A class of Laplacian multiwavelets bases for high-dimensional data
- Quantum speedup of Bayes’ classifiers
- Manifold approximation by moving least-squares projection (MMLS)
- Deep autoencoders for physics-constrained data-driven nonlinear materials modeling
- Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
- Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications
- Testing the manifold hypothesis
- Fast Estimation of Approximate Matrix Ranks Using Spectral Densities
- Iterative multiplicative filters for data labeling
- Equi-affine invariant geometry for shape analysis
- Fast and accurate randomized algorithms for linear systems and eigenvalue problems
- \textit{Kernel cuts}: kernel and spectral clustering meet regularization
- A supervised non-linear dimensionality reduction approach for manifold learning
- A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching
- Spectral convergence of the connection Laplacian from random samples
- Hierarchical shape segmentation and registration via topological features of Laplace-Beltrami eigenfunctions
- Predicting articulated human motion from spatial processes
- Discriminant sparse neighborhood preserving embedding for face recognition
- Learning the dynamical system behind sensory data
- Semisupervised multimodal dimensionality reduction
- Noisy dynamic simulations in the presence of symmetry: data alignment and model reduction
- Smooth function extension based on high dimensional unstructured data
- Random walk distances in data clustering and applications
- A new reliability-based data-driven approach for noisy experimental data with physical constraints
- Distributed event region detection in wireless sensor networks
- Person-independent head pose estimation using biased manifold embedding
- Supervised locally linear embedding with probability-based distance for classification
- Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
- Concentration of kernel matrices with application to kernel spectral clustering
- Time-series forecasting using manifold learning, radial basis function interpolation, and geometric harmonics
- Density estimators of Gaussian type on closed Riemannian manifolds
- A topological approach to spectral clustering
- Modeling local nonlinear correlations using subspace principal curves
- Using data mining to enable integration of wind resources on the power grid
- Modeling Multivariate Time Series on Manifolds with Skew Radial Basis Functions
- HARDI segmentation via fourth-order tensors and anisotropy preserving similarity measures
- A review on spectral clustering and stochastic block models
- Deep nonparametric estimation of intrinsic data structures by chart autoencoders: generalization error and robustness
- Approximation of functions of few variables in high dimensions
- A robust algorithm for template curve estimation based on manifold embedding
- SICA: subjectively interesting component analysis
- On the regularized Laplacian eigenmaps
- Inverting nonlinear dimensionality reduction with scale-free radial basis function interpolation
- Variations and extension of the convex-concave procedure
- Cross-media retrieval using query dependent search methods
- Text data mining: theory and methods
- A spectral graph approach to discovering genetic ancestry
- Toward quantifying vertex similarity in networks
- Rigid transformations for stabilized lower dimensional space to support subsurface uncertainty quantification and interpretation
- Geometric triangulations and discrete Laplacians on manifolds: an update
- DISTANCE-RATIO LEARNING FOR DATA VISUALIZATION
- Delay-coordinate maps, coherence, and approximate spectra of evolution operators
- Product formalisms for measures on spaces with binary tree structures: representation, visualization, and multiscale noise
- Hermite learning with gradient data
- Selection of variables and dimension reduction in high-dimensional non-parametric regression
- A comparative study: globality versus locality for graph construction in discriminant analysis
This page was built for publication: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4816852)
