Abstract
Central to the field of Computer Science is the issue of storing, maintaining and retrieving data, and the “list” structure, maintained as a Singly-Linked-List (SLL), leads to one such Adaptive Data Structure (ADS). Recently, researchers have proposed the concept of hierarchical Singly-Linked-Lists on Singly-Linked-Lists (SLLs-on-SLLs), where the primitive elements of the primary list are, in and of themselves, sub- lists. The question of knowing which elements should be in the respective sub-lists is far from trivial, and is achieved using Learning Automata (LA). This paper demonstrates how we can incorporate one such LA, namely the Pursuit-Enhanced Object Migration Automaton (PEOMA) to improve the performance of the ADS operating in Non-stationary Environments (NSEs). The ADS is designed as a hierarchical SLL-on- SLL. The hierarchical concept employs a sub-context data structure to group together the elements that have a probabilistic dependence in the “unknown” distribution of the Environment. In this paper, we propose that the PEOMA reinforcement scheme can be powerful in learning the probabilistic distribution of the Environment to capture dependent elements within the sub-groups. The PEOMA improves on its predecessor algorithm by incorporating the Pursuit technique, which increases the likelihood of selecting superior actions with higher reward estimates by “pursuing” the currently known “best” action. The research shows that the PEOMA-enhanced SLLs-on-SLLs provide results that are an order of magnitude superior to the “de-facto” MTF and TR schemes used in such Environments with so-called “locality of reference”. Also, the results surpass the performances of EOMA-enhanced hierarchical SLLs-on-SLLs schemes in NSEs including when the data-structure has some knowledge of the change in the dependence distribution of the Environment.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Although this is referred to as a “deadlock” in the literature, it could probably, be better termed as a “livelock”.
- 2.
- 3.
A comprehensive list of these application domains is given in [13].
- 4.
References
Amer, A., Oommen, B.J.: A novel framework for self-organizing lists in environments with locality of reference: lists-on-lists. Comput. J. 50, 186–196 (2007)
Bachrach, R., El-Yaniv, R., Reinstadtler, M.: On the competitive theory and practice of online list accessing algorithms. Algorithmica 32(2), 201–245 (2002)
Bisong, E.O.: On designing adaptive data structures with adaptive data “sub”-structures. MCS thesis, Carleton University, Ottawa (2018)
Bisong, O.E., Oommen, B.J.: Optimizing self-organizing lists-on-lists using enhanced object partitioning. In: MacIntyre, J., Maglogiannis, I., Iliadis, L., Pimenidis, E. (eds.) AIAI 2019. IAICT, vol. 559, pp. 451–463. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-19823-7_38
Bisong, E.O., Oommen, B.J.: Self-organizing lists-on-lists that invoke Pursuit-based deadlock-free object partitioning. Unabridged version of this paper
Gale, W., Das, S., Yu, C.T.: Improvements to an algorithm for equipartitioning. IEEE Trans. Comput. 39(5), 706–710 (1990)
Hester, J.H., Hirschberg, D.S.: Self-organizing linear search. ACM Comput. Surv. (CSUR) 17(3), 295–311 (1985)
McCabe, J.: On serial files with relocatable records. Oper. Res. 13(4), 609–618 (1965)
Narendra, K.S., Thathachar, M.A.L.: Learning Automata: An Introduction. Courier Corporation, North Chelmsford (2012)
Oommen, B.J., Ma, D.C.Y.: Deterministic learning automata solutions to the equipartitioning problem. IEEE Trans. Comput. 37(1), 2–14 (1988)
Oommen, B.J., Ma, D.C.Y.: Stochastic automata solutions to the object partioning problem. Comput. J. 35, A105–A120 (1992)
Rivest, R.: On self-organizing sequential search heuristics. Commun. ACM 19(2), 63–67 (1976)
Shirvani, A.: Novel solutions and applications of the object partitioning problem. Ph.D. thesis, Carleton University, Ottawa (2018)
Thathachar, M.A.L., Sastry, P.S.: A new approach to the design of reinforcement schemes for learning automata. IEEE Trans. Syst. Man Cybern. SMC-15(1), 168–175 (1985)
Zhang, X., Granmo, O.-C., Oommen, B.J., Jiao, L.: A formal proof of the e-optimality of absorbing continuous pursuit algorithms using the theory of regular functions. Appl. Intell. 41, 974–985 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Bisong, O.E., Oommen, B.J. (2019). Optimizing Self-organizing Lists-on-Lists Using Pursuit-Oriented Enhanced Object Partitioning. In: Huang, DS., Huang, ZK., Hussain, A. (eds) Intelligent Computing Methodologies. ICIC 2019. Lecture Notes in Computer Science(), vol 11645. Springer, Cham. https://doi.org/10.1007/978-3-030-26766-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-26766-7_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26765-0
Online ISBN: 978-3-030-26766-7
eBook Packages: Computer ScienceComputer Science (R0)