This paper presents a method to develop a class of variable memory Markov models that have higher memory capacity than traditional (uniform memory) Markov models. The structure of the variable memory models is induced from a manually annotated corpus through a decision tree learning algorithm. A series of comparative experiments show the resulting models outperform uniform memory Markov models ...

We describe our approach for the automatic composition of monophone melodies on a user given chord sequence. For this purpose we use Markov-chains and other methods to build some initial individuals. These are then optimised with evolutionary algorithms using automatically learned classifiers next to interactive evaluation as fitness functions. Key–Words: computational Intelligence, automatic c...

The wavelet-domain Hidden Markov Tree Model can properly describe the dependence and correlation of fundus angiographic images' wavelet coefficients among scales. Based on the construction of the fundus angiographic images Hidden Markov Tree Models and Gaussian Mixture Models, this paper applied expectation-maximum algorithm to estimate the wavelet coefficients of original fundus angiographic i...

* Correspondence: [email protected] Faculty of Science, Jiangsu University, Zhenjiang 212013, China Full list of author information is available at the end of the article Abstract In this paper, we are to establish a class of strong deviation theorems for the random fields relative to mth-order nonhomogeneous Markov chains indexed by an m rooted Cayley tree. As corollaries, we obtain the st...

In this paper we present an approach to tree recognition and localisation in orchard environments for tree-crop applications. The method builds on the natural structure of the orchard by first segmenting the data into individual trees using a Hidden Semi-Markov Model. Second, a descriptor for representing the characteristics of the trees is introduced, allowing a Hidden Markov Model based match...

In team Markov games research, it is difficult for an individual agent to calculate the reward of collaborative agents dynamically. We present a coordination tree structure whose nodes are agent subsets or an agent. Two kinds of weights of a tree are defined which describe the cost of an agent collaborating with an agent subset. We can calculate a collaborative agent subset and its minimal cost...