On utilizing an enhanced object partitioning scheme to optimize self-organizing lists-on-lists

With the advent of “Big Data” as a field, in and of itself, there are at least three fundamentally new questions that have emerged, namely the Artificially Intelligence (AI)-based algorithms required, the hardware to process the data, and the methods to store and access the data efficiently. This paper (The work of the second author was partially supported by NSERC, the Natural Sciences and Engineering Council of Canada. We are very grateful for the feedback from the anonymous Referees of the original submission. Their input significantly improved the quality of this final version.) presents some novel schemes for the last of the three areas. There have been thousands of papers written regarding the algorithms themselves, and the hardware vendors are scrambling for the market share. However, the question of how to store, manage and access data, which has been central to the field of Computer Science, is even more pertinent in these days when megabytes of data are being generated every second. This paper considers the problem of minimizing the cost of retrieval using the most fundamental data structure, i.e., a Singly-Linked List (SLL). We consider a SLL in which the elements are accessed by a Non-stationary Environment (NSE) exhibiting the so-called “Locality of Reference”. We propose a solution to the problem by designing an “Adaptive” Data Structure (ADS), which is created by utilizing a composite of hierarchical data “sub”-structures to constitute the overall data structure (In this paper, the primitive data structure is the SLL. However, these concepts can be extended to more complicated data structures.). In this paper, we design hierarchical Lists-on-Lists (LOLs) by assembling a SLL into a hierarchical scheme that results in SLLs on SLLs (SLLs-on-SLLs) comprising of an outer-list and sublist contexts. The goal is that elements that are more likely to be accessed together are grouped within the same sub-context, while the sublists themselves are moved “en masse” towards the head of the list-context to minimize the overall access cost. This move is carried out by employing the “de-facto” list re-organization schemes, i.e., the Move-To-Front (MTF) and Transposition (TR) rules. To achieve the clustering of elements within the sublists, we invoke the Object Migration Automaton (OMA) family of reinforcement schemes from the theory of Learning Automata (LA). They capture the probabilistic dependence of the elements in the data structure, receiving query accesses from the Environment. We show that SLLs-on-SLLs augmented with the Enhanced OMA (EOMA) minimizes the retrieval cost for elements in NSEs, and are superior to the stand-alone MTF and TR schemes, and also superior to the OMA-augmented SLLs-on-SLLs operating in such Environments.

[1]  Sandy Irani,et al.  Two Results on the List Update Problem , 1991, Inf. Process. Lett..

[2]  Ronald L. Rivest,et al.  On self-organizing sequential search heuristics , 1976, CACM.

[3]  B. John Oommen,et al.  A Fixed Structure Learning Automaton Micro-aggregation Technique for Secure Statistical Databases , 2006, Privacy in Statistical Databases.

[4]  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).

[5]  Hannes Hartenstein,et al.  Stochastic Properties of the Random Waypoint Mobility Model , 2004, Wirel. Networks.

[6]  M. L. Tsetlin.  FINITE AUTOMATA AND MODELS OF SIMPLE FORMS OF BEHAVIOUR , 1963 .

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

[8]  Ali Safari Mamaghani,et al.  A Learning Automaton Based Approach for Data Fragments Allocation in Distributed Database Systems , 2010, 2010 10th IEEE International Conference on Computer and Information Technology.

[9]  Anis Yazidi,et al.  Achieving Intelligent Traffic-Aware Consolidation of Virtual Machines in a Data Center Using Learning Automata , 2016, 2016 8th IFIP International Conference on New Technologies, Mobility and Security (NTMS).

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

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

[12]  Ran El-Yaniv,et al.  On the Competitive Theory and Practice of Online List Accessing Algorithms , 2001, Algorithmica.

[13]  Daniel S. Hirschberg,et al.  Self-organizing search lists using probabilistic back-pointers , 1987, CACM.

[14]  Fredrik Meyn Ung.  Towards efficient and cost-effective live migrations of virtual machines , 2015 .

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

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

[17]  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.

[18]  Abdolreza Shirvani,et al.  Novel Solutions and Applications of the Object Partitioning Problem , 2018 .

[19]  S. Lakshmivarahan,et al.  Absolutely Expedient Learning Algorithms For Stochastic Automata , 1973 .

[20]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[21]  B. John Oommen,et al.  Discretized Bayesian Pursuit - A New Scheme for Reinforcement Learning , 2012, IEA/AIE.

[22]  Aaron M. Tenenbaum,et al.  Two Spectra of Self-Organizing Sequential Search Algorithms , 1982, SIAM J. Comput..

[23]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[24]  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..

[25]  Akaki Jobava,et al.  Intelligent Traffic-aware Consolidation of Virtual Machines in a Data Center , 2015 .

[26]  King-Sun Fu,et al.  IEEE Transactions on Pattern Analysis and Machine Intelligence Publication Information , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  B. J. Oommen,et al.  Breaking Substitution Cyphers Using Stochastic Automata , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

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

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

[30]  Abdorasoul Ghasemi,et al.  A Distributed Learning Automata Scheme for Spectrum Management in Self-Organized Cognitive Radio Network , 2017, IEEE Transactions on Mobile Computing.

[31]  Krinskii Vi.  ASYMPTOTIC OPTIMAL AUTOMATION WITH EXPONENTIAL SPEED OF CONVERGENCE , 1964 .

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

[33]  Adrian Baddeley,et al.  spatstat: An R Package for Analyzing Spatial Point Patterns , 2005 .

[34]  B. John Oommen,et al.  Fast Learning Automaton-Based Image Examination and Retrieval , 1993, Comput. J..

[35]  B. John Oommen,et al.  Discretized pursuit learning automata , 1990, IEEE Trans. Syst. Man Cybern..

[36]  Anis Yazidi,et al.  Service selection in stochastic environments: a learning-automaton based solution , 2012, Applied Intelligence.

[37]  B. John Oommen,et al.  Absorbing and Ergodic Discretized Two-Action Learning Automata , 1986, IEEE Trans. Syst. Man Cybern..

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

[39]  B. John Oommen,et al.  Discretized estimator learning automata , 1992, IEEE Trans. Syst. Man Cybern..

[40]  B.J. Oommen,et al.  On discretizing estimator-based learning algorithms , 1991, Conference Proceedings 1991 IEEE International Conference on Systems, Man, and Cybernetics.

[41]  Antonio Pescapè,et al.  A sleep scheduling approach based on learning automata for WSN partial coverage , 2017, J. Netw. Comput. Appl..

[42]  Ekaba Ononse Bisong,et al.  On Designing Adaptive Data Structures with Adaptive Data "Sub"-Structures , 2019 .

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

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

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

[46]  Jon Louis Bentley,et al.  Amortized analyses of self-organizing sequential search heuristics , 1985, CACM.

[47]  B. John Oommen,et al.  Continuous and discretized pursuit learning schemes: various algorithms and their comparison , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[48]  B. Johnoommen.  Absorbing and Ergodic Discretized Two-Action Learning Automata , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[49]  Daniel S. Hirschberg,et al.  Self-organizing linear search , 1985, CSUR.

[50]  B. John Oommen,et al.  Generalized pursuit learning schemes: new families of continuous and discretized learning automata , 2002, IEEE Trans. Syst. Man Cybern. Part B.