Text Mining Using Markov Chains of Variable Length [PDF]
, 2006 When dealing with knowledge federation over text documents one has to figure out whether or not documents are related by context. A new approach is proposed to solve this problem. This leads to the design of a new search engine for literature research and related problems. The idea is that one has already some documents of interest.
Björn Hoffmeister, Thomas Zeugmann
openaire +1 more source
Particle Metropolis-Hastings using gradient and Hessian information [PDF]
, 2014 Particle Metropolis-Hastings (PMH) allows for Bayesian parameter inference in nonlinear state space models by combining Markov chain Monte Carlo (MCMC) and particle filtering. The latter is used to estimate the intractable likelihood.
Dahlin, Johan +2 more
core +4 more sources
Alignment-free Transcriptomic and Metatranscriptomic Comparison Using Sequencing Signatures with Variable Length Markov Chains [PDF]
Scientific Reports, 2016 AbstractThe comparison between microbial sequencing data is critical to understand the dynamics of microbial communities. The alignment-based tools analyzing metagenomic datasets require reference sequences and read alignments. The available alignment-free dissimilarity approaches model the background sequences with Fixed Order Markov Chain (FOMC ...
Weinan Liao +6 more
openaire +2 more sources
Behavioral sequence analysis reveals a novel role for beta2* nicotinic receptors in exploration.
PLoS Computational Biology, 2008 Nicotinic acetylcholine receptors (nAChRs) are widely expressed throughout the central nervous system and modulate neuronal function in most mammalian brain structures.
Nicolas Maubourguet +4 more
doaj +1 more source
Chains of infinite order, chains with memory of variable length, and maps of the interval
, 2012 We show how to construct a topological Markov map of the interval whose invariant probability measure is the stationary law of a given stochastic chain of infinite order.
Antonio Galves +18 more
core +1 more source
Variable length Markov chains and dynamical sources
, 2010 45 pages, 15 ...
Cénac, Peggy +3 more
openaire +2 more sources
Enhanced List-Based Simulated Annealing Algorithm for Large-Scale Traveling Salesman Problem
IEEE Access, 2019 List-based simulated annealing (LBSA) algorithm is a novel simulated annealing algorithm where list-based cooling scheme is used to control the change of parameter temperature.
Lijin Wang +3 more
doaj +1 more source
Bayesian analysis of variable-order, reversible Markov chains
, 2011 We define a conjugate prior for the reversible Markov chain of order $r$. The prior arises from a partially exchangeable reinforced random walk, in the same way that the Beta distribution arises from the exchangeable Poly\'{a} urn.
Bacallado, Sergio
core +1 more source
Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes
, 2012 A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the dynamics of $(S_t)$. This so-called "persistent" random walk is nolonger Markovian and, under suitable conditions, the
Cénac, Peggy +3 more
openaire +3 more sources
Asymmetric diffusion of cosmic rays [PDF]
, 2015 Cosmic ray propagation is diffusive because of pitch angle scattering by waves. We demonstrate that if the high-amplitude magnetohydrodynamic turbulence with $\tilde B/\langle B\rangle \sim 1$ is present on top of the mean field gradient, the diffusion ...
Medvedev, Mikhail V. +1 more
core +2 more sources