Introducing User-Prescribed Constraints in Markov Chains for Nonlinear Dimensionality Reduction
From MaRDI portal
Publication:5154157
DOI10.1162/neco_a_01184zbMath1475.62126DBLPjournals/neco/Dixit19arXiv1806.05096OpenAlexW2885570288WikidataQ92441363 ScholiaQ92441363MaRDI QIDQ5154157
Publication date: 1 October 2021
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.05096
Parametric inference under constraints (62F30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Unnamed Item
- Unnamed Item
- Computational Optimal Transport: With Applications to Data Science
- A filtering technique for Markov chains with applications to spectral embedding
- Diffusion-based kernel methods on Euclidean metric measure spaces
- Diffusion maps for changing data
- Diffusion maps
- Diffusion maps, spectral clustering and reaction coordinates of dynamical systems
- The Kullback–Leibler Divergence Rate Between Markov Sources
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Entropy production rate as a criterion for inconsistency in decision theory
This page was built for publication: Introducing User-Prescribed Constraints in Markov Chains for Nonlinear Dimensionality Reduction