Abstract
There are numerous applications in Artificial Intelligence (AI) and Machine Learning (ML) where the criteria for decisions are based on testing procedures. The most common tools used in such random phenomena involve Random Walks (RWs). The theory of RWs and its applications have gained an increasing research interest since the start of the last century. [1]. In this context, we note that a RW is, usually, defined as a trajectory involving a series of successive random steps, which are, quite naturally, modeled using Markov Chains (MCs). MCs are probabilistic structures that possess the so-called “Markov property” – which implies that the next “state” of the walk depends on the current state and not on the entire past states (or history). This imparts to the structure practical consequential implications since it permits the modeler to predict how the chain will behave in the immediate and distant future, and to thus quantify its behavior.
Although Random Walks (RWs) with single-step transitions have been extensively studied for almost a century, problems involving the analysis of RWs that contain interleaving random steps and random “jumps” are intrinsically hard. In this paper, we consider the analysis of one such fascinating RW, where every step is paired with its counterpart random jump. Apart from this RW being conceptually interesting, it also has applications in the testing of entities (components or personnel), where the entity is never allowed to make more than a pre-specified number of consecutive failures. The paper contains the analysis of the chain, some fascinating limiting properties, and simulations that justify the analytic results. The generalization for a researcher to use the same strategy to know when an AI scheme should switch from “Exploration” to “Exploitation” is an extremely interesting avenue for future research.
As far as we know, the entire field of RWs with interleaving steps and jumps is novel, and we believe that this is a pioneering paper in this field, with vast potential in AI and ML.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pearson, K.A.R.L.: The Problem of the Random Walk. Nature 72(1867), 342 (1905)
Berg, H.C.: Random Walks in Biology. Revised edn. Princeton University Press, Princeton (1993)
Nowak, M.A.: Evolutionary Dynamics: Exploring the Equations of Life. Belknap Press of Harvard University Press (September 2006)
Gross, D., Harris, C.M.: Fundamentals of Queueing Theory (Wiley Series in Probability and Statistics). Wiley Interscience, Hoboken (1998)
Takacs, L.: On the classical ruin problems. Journal of the American Statistical Association 64(327), 889–906 (1969)
Paulsen, J.: Ruin theory with compounding assets – a survey. Insurance: Mathematics and Economics 22(1), 3–16 (1998); Special issue on the interplay between insurance, finance and control
Bower, G.H.: A turning point in mathematical learning theory. Psychological Review 101(2), 290–300 (1994)
Camp, T., Boleng, J., Davies, V.: A Survey of Mobility Models for Ad Hoc Network Research. Wireless Communications & Mobile Computing (WCMC): Special issue on Mobile Ad Hoc Networking: Research, Trends and Applications 2(5), 483–502 (2002)
Fouss, F., Pirotte, A., Renders, J.-M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19(3), 355–369 (2007)
Altman, A., Tennenholtz, M.: Ranking systems: the pagerank axioms. In: EC 2005: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 1–8. ACM, New York (2005)
Bishop, P.G., Pullen, F.D.: A random walk through software reliability theory, pp. 83–111 (1991)
Oommen, B.J.: Absorbing and ergodic discretized two-action learning automata. IEEE Transactions on Systems, Man, and Cybernetics SMC-16, 282–293 (1986)
Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn., vol. 1. Wiley, Chichester (1968)
Yazidi, A., Granmo, O.C., Oommen, B.: On the analysis of a random walk-jump process with applications to testing, unabridged version of this paper (submitted for publication)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yazidi, A., Granmo, OC., Oommen, B.J. (2011). A New Tool for the Modeling of AI and Machine Learning Applications: Random Walk-Jump Processes. In: Corchado, E., Kurzyński, M., Woźniak, M. (eds) Hybrid Artificial Intelligent Systems. HAIS 2011. Lecture Notes in Computer Science(), vol 6678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21219-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-21219-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21218-5
Online ISBN: 978-3-642-21219-2
eBook Packages: Computer ScienceComputer Science (R0)