On enhancing the object migration automaton using the Pursuit paradigm

Abstract One of the most difficult problems that is all-pervasive in computing is that of partitioning. It has applications in the partitioning of databases into relations, the realization of the relations themselves into sub-relations based on the partitioning of the attributes, the assignment of processes to processors, graph partitioning, and the task assignment problem, etc. The problem is known to be NP-hard. The benchmark solution for this for the Equi-Partitioning Problem (EPP) has involved the classic field of Learning Automata (LA), and the corresponding algorithm, the Object Migrating Automata (OMA) has been used in all of these application domains. While the OMA is a fixed structure machine, it does not incorporate the Pursuit concept that has, recently, significantly enhanced the field of LA. In this paper, we pioneer the incorporation of the Pursuit concept into the OMA. We do this by a non-intuitive paradigm, namely that of removing (or discarding) from the query stream, queries that could be counter-productive. This can be perceived as a filtering agent triggered by a pursuit-based module. The resulting machine, referred to as the Pursuit OMA (POMA), has been rigorously tested in all the standard benchmark environments. Indeed, in certain extreme environments it is almost ten times faster than the original OMA reported in the legacy papers. 1 The application of the POMA to these application domains is extremely promising.

[1]  Kaddour Najim,et al.  Learning automata and stochastic optimization , 1997 .

[2]  Mohammad Reza Meybodi,et al.  New Learning Automata Based Algorithms for Adaptation of Backpropagation Algorithm Parameters , 2002, Int. J. Neural Syst..

[3]  Georgios I. Papadimitriou,et al.  Learning-automata-based TDMA protocols for broadcast communication systems with bursty traffic , 2000, IEEE Communications Letters.

[4]  Franciszek Seredynski,et al.  Distributed scheduling using simple learning machines , 1998, Eur. J. Oper. Res..

[5]  B. John Oommen,et al.  Deterministic Learning Automata Solutions to the Equipartitioning Problem , 1988, IEEE Trans. Computers.

[6]  Eugene C. Freuder.  The Object Partition Problem , 1971 .

[7]  Mohammad S. Obaidat,et al.  Adaptive and Learning Systems , 2010, IEEE Trans. Syst. Man Cybern. Part B.

[8]  Pushkin Kachroo,et al.  Simulation study of multiple intelligent vehicle control using stochastic learning automata , 1997 .

[9]  Frederick Mosteller,et al.  Stochastic Models for Learning , 1956 .

[10]  Mohammad Reza Meybodi,et al.  Applying continuous action reinforcement learning automata(CARLA) to global training of hidden Markov models , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[11]  M. Thathachar,et al.  Networks of Learning Automata: Techniques for Online Stochastic Optimization , 2003 .

[12]  Harley Bornbach,et al.  An introduction to mathematical learning theory , 1967 .

[13]  Athanasios V. Vasilakos,et al.  The Use of Reinforcement Learning Algorithms in Traffic Control of High Speed Networks , 2002, Advances in Computational Intelligence and Learning.

[14]  Mohammad S. Obaidat,et al.  Guest editorial learning automata: theory, paradigms, and applications , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[15]  Kaddour Najim,et al.  Learning Automata: Theory and Applications , 1994 .

[16]  M. L. Tsetlin,et al.  Automaton theory and modeling of biological systems , 1973 .

[17]  Clement T. Yu,et al.  Improvements to an Algorithm for Equipartitioning , 1990, IEEE Trans. Computers.

[18]  B. John Oommen,et al.  Stochastic Automata Solutions to the Object Partitioning Problem , 1991, Comput. J..

[19]  S. Lakshmivarahan,et al.  Learning Algorithms Theory and Applications , 1981 .

[20]  Arvola Chan,et al.  Index selection in a self-adaptive data base management system , 1976, SIGMOD '76.

[21]  B. John Oommen,et al.  GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks , 2004, Int. J. Commun. Syst..

[22]  Clement T. Yu,et al.  Adaptive record clustering , 1985, TODS.

[23]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[24]  Witold Pedrycz,et al.  Optimizing QoS routing in hierarchical ATM networks using computational intelligence techniques , 2003, IEEE Trans. Syst. Man Cybern. Part C.

[25]  P. S. Sastry,et al.  A Class of Rapidly Converging Algorithms for Learning Automata , 1984 .

[26]  Mohammad S. Obaidat,et al.  Learning automata-based bus arbitration for shared-medium ATM switches , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[27]  Athanasios V. Vasilakos,et al.  The use of learning algorithms in ATM networks call admission control problem: a methodology , 2000, Comput. Networks.

[28]  B. John Oommen,et al.  Achieving Microaggregation for Secure Statistical Databases Using Fixed-Structure Partitioning-Based Learning Automata , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[29]  Michael Hammer,et al.  A heuristic approach to attribute partitioning , 1979, SIGMOD '79.