A Canonical Representation for Aggregated Markov Processes
نویسنده
چکیده
A deterministic function of a Markov process is called an aggregated Markov process. We give necessary and suucient conditions for the equivalence of continuous-time aggregated Markov processes. For both discrete-and continuous-time, we show that any aggregated Markov process which satisses mild regularity conditions can be directly converted to a canonical representation which is unique for each class of equivalent models, and furthermore, is a minimal parameteriza-tion of all that can be identiied about the underlying Markov process. Hidden Markov models on nite state spaces may be framed as aggregated Markov processes by expanding the state space and thus also have canonical representations. 1 Introduction Consider a continuous-time nite state space Markov process, fX(t); t 0g
منابع مشابه
Canonical representation of order 2 transient Markov and rational arrival processes
Similar to other processes that are modulated by background Markov chains the matrix representation of a transient Markov arrival process is not unique and the use of a convenient unique canonical form is essential for practical computations. The paper presents a set of 5 Markovian forms which provide a unique and minimal representation for all members of the TMAP(2) class. In the course of the...
متن کاملCanonical representation for approximating solution of fuzzy polynomial equations
In this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. We transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters Value, Ambiguity and Fuzziness.
متن کاملOn Adaptive Optimization of Filter Performance Based on Markov Representation for Output Prediction Error
This paper addresses the problem of how one can improve the performance of a non-optimal filter. First the theoretical question on dynamical representation for a given time correlated random process is studied. It will be demonstrated that for a wide class of random processes, having a canonical form, there exists a dynamical system equivalent in the sense that its output has the same covarianc...
متن کاملFitting traffic traces with discrete canonical phase type distributions and Markov arrival processes
Recent developments of matrix analytic methods make phase type distributions (PHs) and Markov Arrival Processes (MAPs) promising stochastic model candidates for capturing traffic trace behaviour and for efficient usage in queueing analysis. After introducing basics of these sets of stochastic models, the paper discusses the following subjects in detail: (i) PHs and MAPs have different represent...
متن کاملEquivalence and Reduction of Hidden Markov Models Equivalence and Reduction of Hidden Markov Models
Hidden Markov Models are one of the most popular and successful techniques used in statistical pattern recognition. However, they are not well understood on a fundamental level. For example, we do not know how to characterize the class of processes that can be well approximated by HMMs. This thesis tries to uncover the source of the intrinsic expressiveness of HMMs by studying when and why two ...
متن کامل