The Partition Markov Model characterizes the process by a partition of the state space, where the elements in each part of share the same transition probability to an arbitrary element in the alphabet. This model aims to answer the following questions: what is the minimal number of parameters needed to specify a Markov chain and how to estimate these parameters. In order to answer these questions, we build a consistent strategy for model selection which consist of: giving a size n realization of the process, finding a model within the Partition Markov class, with a minimal number of parts to represent the process law. From the strategy, we derive a measure that establishes a metric in the state space. In addition, we show that if the law of the process is Markovian, then, eventually, when n goes to infinity, will be retrieved. We show an application to model internet navigation patterns.
1 March 2007 in Chemometrics and Intelligent Laboratory Systems
The main purpose of this article is to introduce the E-Bayesian approach to gain flexibility in the reliability-availability system estimation. This approach will be used in series systems, parallel systems, and k-out-of-m systems, based on exponential distribution under squared error loss function, when time is continuous. We use three prior distributions to investigate its impact on the E-Bayesian approach, those prior distributions cover a big spectrum of possibilities. We show in real examples and also by simulations, how the procedure behaves. In the simulation study also we explore the impact on this estimation approach, when the number of components of the system increases.
29 May 2018 in Applied Stochastic Models in Business and Industry