Markov Models Research Papers - Academia.edu (original) (raw)

Land-cover and land-use (LCLU) change was quantified for the last 35 years within and in the vicinity of a fast growing city in Mexico, using rectified aerial photographs and geographic information systems (GIS). LCLU change was projected... more

Land-cover and land-use (LCLU) change was quantified for the last 35 years within and in the vicinity of a fast growing city in Mexico, using rectified aerial photographs and geographic information systems (GIS). LCLU change was projected for the next 20 years using Markov chains ...

The parameters of a discrete stationary Markov model are transition probabilities between states. Traditionally, data consist in sequences of observed states for a given number of individuals over the whole observation period. In such a... more

The parameters of a discrete stationary Markov model are transition probabilities between states. Traditionally, data consist in sequences of observed states for a given number of individuals over the whole observation period. In such a case, the estimation of transition probabilities is straightforwardly made by counting one-step moves from a given state to another. In many real-life problems, however, the inference is much more difficult as state sequences are not fully observed, namely the state of each individual is known only for some given values of the time variable. A review of the problem is given, focusing on Monte Carlo Markov Chain (MCMC) algorithms to perform Bayesian inference and evaluate posterior distributions of the transition probabilities in this missing-data framework. Leaning on the dependence between the rows of the transition matrix, an adaptive MCMC mechanism accelerating the classical Metropolis-Hastings algorithm is then proposed and empirically studied.

In this paper we present a method for transient analysis of availability and survivability of a system with the identical components and identical repairmen. The considered system is supposed to consist of series of k-out-of-n or parallel... more

In this paper we present a method for transient analysis of availability and survivability of a system with the identical components and identical repairmen. The considered system is supposed to consist of series of k-out-of-n or parallel components. We employed the Markov models, eigen vectors and eigenvalues for analyzing the transient availability and survivability of the system. The method is implemented through an algorithm which is tested in MATLAB programming environment. The new method enjoys a stronger mathematical foundation and more flexibility for analyzing the transient availability and survivability of the system.

With the rapid growth of information on the Web and increase of users who are daily visiting the web sites, presenting information proportionate to requirements of users who are visiting a special website so that they could find their... more

With the rapid growth of information on the Web and increase of users who are daily visiting the web sites, presenting information proportionate to requirements of users who are visiting a special website so that they could find their desired information would be essential. Therefore, analyzing browsing behavior of web users and modeling this behavior has particular importance. The aim of recommender systems is guiding users to find their favorite resources and meet their needs, using the information obtained from the previous users’ interactions. In this paper, to predict the web pages with high precision, a hybrid algorithm of clustering technique, All-K th-Order Markov model, and neural network are presented. For this purpose, in order to model users’ movement behavior, after clustering those with the same interests, the sequential patterns are extracted on users’ sessions of each cluster using all-4th-order Markov model. Next, in the step of pages recommendation to a current user, which is performed in an online state, first, a current user session is assigned to a cluster using neural network. Then Markov model created on the cluster which has the nearest match to the current session, is applied and a sequence of pages, which the users are interested to view, is included in the list of recommendation. The implementation results demonstrate that the proposed algorithm has higher precision and recall comparing to other recommender systems.

Predicting mycobacterial sequences promoter of protein synthesis is important in the study of protein metabolism regulation. This goal is however considered a challenging computational biology task due to low inter-sequences homology.... more

Predicting mycobacterial sequences promoter of protein synthesis is important in the study of protein metabolism regulation. This goal is however considered a challenging computational biology task due to low inter-sequences homology. Consequently, a previous work based only on DNA sequence had to use a large input parameter set and multilayered feed-forward ANN architecture trained using the error-back-propagation algorithm to raise

High accuracy sequence classification often re- quires the use of higher order Markov models (MMs). However, the number of MM parameters increases exponentially with the range of direct dependencies between sequence elements, thereby... more

High accuracy sequence classification often re- quires the use of higher order Markov models (MMs). However, the number of MM parameters increases exponentially with the range of direct dependencies between sequence elements, thereby increasing the risk of overfitting when the data set is limited in size. We present abstraction augmented Markov models (AAMMs) that effectively reduce the number of nu- meric parameters of kth order MMs by successively grouping strings of length k (i.e., k-grams) into abstraction hierarchies. We evaluate AAMMs on three protein subcellular localization prediction tasks. The results of our experiments show that abstraction makes it possible to construct predictive models that use significantly smaller number of features (by one to three orders of magnitude) as compared to MMs. AAMMs are competitive with and, in some cases, significantly outperform MMs. Moreover, the results show that AAMMs often perform significantly better than variable order Markov models, such as decomposed context tree weighting, prediction by partial match, and probabilistic suffix trees.