Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
From MaRDI portal
Publication:4816852
DOI10.1162/089976603321780317zbMath1085.68119OpenAlexW2097308346WikidataQ114829952 ScholiaQ114829952MaRDI QIDQ4816852
Publication date: 14 September 2004
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/089976603321780317
Related Items (only showing first 100 items - show all)
Local kernels and the geometric structure of data ⋮ 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) ⋮ Bayesian manifold regression ⋮ Deep kernel dimensionality reduction for scalable data integration ⋮ Natural graph wavelet packet dictionaries ⋮ Diffusion-based kernel methods on Euclidean metric measure spaces ⋮ Learning from patches by efficient spectral decomposition of a structured kernel ⋮ Topological analysis of syntactic structures ⋮ Embedding tangent space extreme learning machine for EEG decoding in brain computer interface systems ⋮ Hölder-Lipschitz norms and their duals on spaces with semigroups, with applications to earth mover's distance ⋮ Geometry on probability spaces ⋮ Impact of regularization on spectral clustering ⋮ Translated Poisson mixture model for stratification learning ⋮ Topology-invariant similarity of nonrigid shapes ⋮ The spectrum of kernel random matrices ⋮ Hermite learning with gradient data ⋮ Optimization of the maximum likelihood estimator for determining the intrinsic dimensionality of high-dimensional data ⋮ Embedding Riemannian manifolds by the heat kernel of the connection Laplacian ⋮ On the incommensurability phenomenon ⋮ Robust kernel Isomap ⋮ Spatial-spectral operator theoretic methods for hyperspectral image classification ⋮ The Cauchy--Schwarz divergence and Parzen windowing: Connections to graph theory and Mercer kernels ⋮ Nearest-neighbor classifier motivated marginal discriminant projections for face recognition ⋮ Fuzzy spectral clustering by PCCA+: application to Markov state models and data classification ⋮ State-space analysis of working memory in schizophrenia: an fBIRN study ⋮ Localization from incomplete noisy distance measurements ⋮ Graph embedding using tree edit-union ⋮ Latent semantic analysis and Fiedler retrieval ⋮ Sparse non Gaussian component analysis by semidefinite programming ⋮ A new algorithm of non-Gaussian component analysis with radial kernel functions ⋮ Learning gradients on manifolds ⋮ On information plus noise kernel random matrices ⋮ Wavelet packets for time-frequency analysis of multispectral imagery ⋮ A note on Laplacian eigenmaps ⋮ Learning Markov random walks for robust subspace clustering and estimation ⋮ Trends in extreme learning machines: a review ⋮ Noise reduction method for nonlinear signal based on maximum variance unfolding and its application to fault diagnosis ⋮ Image feature optimization based on nonlinear dimensionality reduction ⋮ Dependence of locally linear embedding on the regularization parameter ⋮ A supervised non-linear dimensionality reduction approach for manifold learning ⋮ A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching ⋮ Hierarchical shape segmentation and registration via topological features of Laplace-Beltrami eigenfunctions ⋮ Predicting articulated human motion from spatial processes ⋮ Approximation of functions of few variables in high dimensions ⋮ Randomized anisotropic transform for nonlinear dimensionality reduction ⋮ Discriminant sparse neighborhood preserving embedding for face recognition ⋮ Agglomerative clustering via maximum incremental path integral ⋮ Iterative denoising ⋮ Path Laplacian matrices: introduction and application to the analysis of consensus in networks ⋮ Graph spectra in computer science ⋮ Variable bandwidth diffusion kernels ⋮ On the regularized Laplacian eigenmaps ⋮ Low-rank bilinear classification: efficient convex optimization and extensions ⋮ Generalized transfer subspace learning through low-rank constraint ⋮ Nonlinear dimensionality reduction using a temporal coherence principle ⋮ Semi-supervised wavelet shrinkage ⋮ Face recognition using Elasticfaces ⋮ Learning sparse gradients for variable selection and dimension reduction ⋮ A tree-based regressor that adapts to intrinsic dimension ⋮ Patch-to-tensor embedding ⋮ Nonlinear manifold representations for functional data ⋮ Supervised optimal locality preserving projection ⋮ Locally discriminative topic modeling ⋮ Constrained large margin local projection algorithms and extensions for multimodal dimensionality reduction ⋮ Low-rank affinity based local-driven multilabel propagation ⋮ Graph optimization for dimensionality reduction with sparsity constraints ⋮ Spectral clustering and the high-dimensional stochastic blockmodel ⋮ A method for visual identification of small sample subgroups and potential biomarkers ⋮ Solving eigenvalue problems on curved surfaces using the closest point method ⋮ A regularized graph layout framework for dynamic network visualization ⋮ Supervised orthogonal discriminant subspace projects learning for face recognition ⋮ Discrete Hessian eigenmaps method for dimensionality reduction ⋮ Modularity revisited: a novel dynamics-based concept for decomposing complex networks ⋮ Trace ratio criterion based generalized discriminative learning for semi-supervised dimensionality reduction ⋮ Laplacian spectral basis functions ⋮ Unsupervised feature selection based on kernel Fisher discriminant analysis and regression learning ⋮ Dimensionality reduction: an interpretation from manifold regularization perspective ⋮ Regression analysis of locality preserving projections via sparse penalty ⋮ Consistency of regularized spectral clustering ⋮ A spectral notion of Gromov-Wasserstein distance and related methods ⋮ Orientability and diffusion maps ⋮ Persistent intersection homology ⋮ Feature extraction using two-dimensional local graph embedding based on maximum margin criterion ⋮ From classifiers to discriminators: a nearest neighbor rule induced discriminant analysis ⋮ Convergence of the point integral method for Laplace-Beltrami equation on point cloud ⋮ Diffusion representations ⋮ Approximating snowflake metrics by trees ⋮ An effective discretization method for disposing high-dimensional data ⋮ Sparsity preserving projections with applications to face recognition ⋮ An estimate of mutual information that permits closed-form optimisation ⋮ Isometric sliced inverse regression for nonlinear manifold learning ⋮ A two-dimensional neighborhood preserving projection for appearance-based face recognition ⋮ Kernel discriminant analysis for regression problems ⋮ Theoretical guarantees for graph sparse coding ⋮ Self-regularized fixed-rank representation for subspace segmentation ⋮ Similarity, kernels, and the fundamental constraints on cognition ⋮ 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
Cites Work
This page was built for publication: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
