Results 221 to 230 of about 152,408 (254)

Context Trees, Variable Length Markov Chains and Dynamical Sources

2012
Infinite random sequences of letters can be viewed as stochastic chains or as strings produced by a source, in the sense of information theory. The relationship between Variable Length Markov Chains (VLMC) and probabilistic dynamical sources is studied.
Cénac, Peggy, Chauvin, Brigitte, Paccaut, Frédéric, Pouyanne, Nicolas   +3 more
openaire   +3 more sources

Semantically Enriched Variable Length Markov Chain Model for Analysis of User Web Navigation Sessions [PDF]

International Journal of Information Technology & Decision Making, 2014
The rapid growth of the World Wide Web has resulted in intricate Web sites, demanding enhanced user skills to find the required information and more sophisticated tools that are able to generate apt recommendations. Markov Chains have been widely used to generate next-page recommendations; however, accuracy of such models is limited.
Suresh Shirgave, Prakash Kulkarni, José Borges   +2 more
openaire   +1 more source

Optimal Variable Length Markov Chain (VLMC) Modeling of Fading Channels

2006 IEEE International Conference on Communications, 2006
Channel characterization and modeling is essential to the wireless communication system design. A model that optimally represents a fading channel with a variable length Markov chain (VLMC) is proposed in this work. VLMC offers a general class of Markov chains whose structure has a variable order and a parsimonious number of transition probabilities ...
Wuttipong Kumwilaisak, C.-c. Kuo, Dapeng Wu   +2 more
openaire   +1 more source

Adaptive variable length Markov chain for non-stationary fading channel modeling

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, 2003
A novel adaptive mapping from the measurements of a non-stationary wireless environment to a variable length Markov chain (VLMC) model is proposed in this research. This scheme consists of two main components: the estimation of channel signal-to-noise ratio (SNR) distribution and discrete VLMC modeling.
W. Kumwilaisak, C.-C.J. Kuo
openaire   +1 more source

Variable Length Markov Chains for Web Usage Mining

2009
Web usage mining is usually defined as the discipline that concentrates on developing techniques that model and study users’ Web navigation behavior by means of analyzing data obtained from user interactions with Web resources; see (Mobasher, 2006; Liu, 2007) for recent reviews on web usage mining.
José Borges, Mark Levene
openaire   +1 more source

Validating Cognitive Human Models for Multiple Target Search Tasks with Variable Length Markov ''Chains

SAE Technical Paper Series, 2003
<div class="htmlview paragraph">This paper describes a method we developed heuristically to validate cognitive models with the aid of variable length MARKOV chains. The focus of the proposed method is the validation of sequences of actions rather than the validation of time consumption.
Carsten Winkelholz, Christopher Schlick, Florian Motz   +2 more
openaire   +1 more source

Statistical variable length markov chains for the parameterization of stochastic user models from sparse data

2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583), 2005
This paper presents an algorithm for the parameterization of variable length Markov chains (VLMC). The disadvantages of the conventional algorithms especially in the application field of stochastic use models are discussed. The algorithm proposed in this paper eliminates these disadvantages by the usage of statistical methods to decide which states are
C. Winkelholz, C. Schlick
openaire   +1 more source

An artificial neural network enhanced Semantic Variable Length Markov Chain Model (ANNSVLMC) for web navigation session mining

2016 International Conference on Communication and Electronics Systems (ICCES), 2016
Markov models are widely utilized for the purpose of analyzing user web navigation sessions. A novel SVLMC (Semantic Variable Length Markov Chain Model)was developed in which recommendations were generated by incorporating semantic data of web pages with navigation history.
R. Rooba, V. ValliMayil
openaire   +1 more source

Exact Schema Theory and Markov Chain Models for Genetic Programming and Variable-length Genetic Algorithms with Homologous Crossover

Genetic Programming and Evolvable Machines, 2004
Genetic Programming (GP) homologous crossovers are a group of operators, including GP one-point crossover and GP uniform crossover, where the offspring are created preserving the position of the genetic material taken from the parents. In this paper we present an exact schema theory for GP and variable-length Genetic Algorithms (GAs) which is ...
Riccardo Poli, Nicholas Freitag McPhee, Jonathan E. Rowe   +2 more
openaire   +1 more source