Weitere Artikel dieser Ausgabe durch Wischen aufrufen
The second author is grateful for the partial support provided by NSERC, the Natural Sciences and Engineering Research Council of Canada. The second author is also an Adjunct Professor at the University of Agder in Grimstad, Norway. A preliminary version of some of the results of this paper was presented at ICTCS’17, the International Conference on New Trends in Computing, Amman, Jordan, in October 2017. 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.
B. J. Oommen: The author is also an Adjunct Professor with University of Agder, Grimstad, Norway.
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Probably, the most reputed solution for partitioning, which has applications in databases, attribute partitioning, processor-based assignment and many other similar scenarios, is the object migration automata (OMA). However, one of the known deficiencies of the OMA is that when the problem size is large, i.e., the number of objects and partitions are large, the probability of receiving a reward, which “strengthens” the current partitioning, from the Environment is not significant. This is because of an internal deadlock scenario which is discussed in this paper. As a result of this, it can take the OMA a considerable number of iterations to recover from an inferior configuration. This property, which characterizes learning automaton (LA) in general, is especially true for the OMA-based methods. In spite of the fact that various solutions have been proposed to remedy this issue for general families of LA, overcoming this hurdle is a completely unexplored area of research for conceptualizing how the OMA should interact with the Environment. Indeed, the best reported version of the OMA, the enhanced OMA (EOMA), has been proposed to mitigate the consequent deadlock scenario. In this paper, we demonstrate that the incorporation of the intrinsic properties of the Environment into the OMA’s design leads to a higher learning capacity and to a more consistent partitioning. To achieve this, we incorporate the state-of-the-art pursuit principle utilized in the field of LA by estimating the Environment’s reward/penalty probabilities and using them to further augment the EOMA. We also verify the performance of our proposed method, referred to as the pursuit EOMA (PEOMA), through simulation, and demonstrate a significant increase in the convergence rate, i.e., by a factor of about forty. It also yields a noticeable reduction in sensitivity to the noise in the Environment. The paper also includes some results obtained for a real-world application domain involving faulty sensors.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
Fayyoumi E, Oommen BJ (2009) Achieving microaggregation for secure statistical databases using fixed-structure partitioning-based learning automata. IEEE Trans Syst Man Cybern B 39(5):1192–1205 CrossRef
Freuder EC (1971) The object partition problem. Vision Flash 4
Gale W, Das S, Yu CT (1990) Improvements to an algorithm for equipartitioning. IEEE Trans Comput 39(5):706–710 CrossRef
Hammer M, Chan A (1976) Index selection in a self-adaptive data base management system. In: Proceedings of the 1976 ACM SIGMOD international conference on management of data. ACM, pp 1–8
Hammer M, Niamir B (1979) A heuristic approach to attribute partitioning. In: Proceedings of the 1979 ACM SIGMOD international conference on management of data. ACM, pp 93–101
Jobava A (2015) Intelligent traffic-aware consolidation of virtual machines in a data center, Master’s thesis, University of Oslo
Ma DCY (1986) Object partitioning by using learning automata, Master’s thesis, Carleton University
Mamaghani AS, Mahi M, Meybodi M (2010) A learning automaton based approach for data fragments allocation in distributed database systems. In: Proceedings of the 2010 IEEE 10th international conference on computer and information technology (CIT). IEEE, pp 8–12
Obaidat MS, Papadimitriou GI, Pomportsis AS (2002) Guest editorial learning automata: theory, paradigms, and applications. IEEE Trans Syst Man Cybern B 32(6):706–709 CrossRef
Narendra KS, Thathachar MAL (2012) Learning automata: an introduction. Courier Corporation, North Chelmsford
Shirvani A (2017) Novel solutions and applications of the object partitioning problem. Ph.D. dissertation, Carleton University, Ottawa, Canada
Shirvani A, Oommen BJ (2017) On utilizing the pursuit paradigm to enhance the deadlock-preventing object migration automaton. In: Proceedings of ICTCS’17, the international conference on new trends in computing. IEEE
Shirvani A, Oommen BJ, Yazidi A (2019) On resolving the “Unreliable Sensor” problem using the enhanced Object Migration Automata. In Preparation
Tsetlin M et al (1973) Automaton theory and modeling of biological systems. Academic Press, Cambridge MATH
Yazidi A, Granmo OC, Oommen BJ (2012) Service selection in stochastic environments: a learning-automaton based solution. Appl Intell 36(3):617–637 CrossRef
Yu CT, Suen C, Lam K, Siu MK (1985) Adaptive record clustering. ACM Trans Database Syst (TODS) 10(2):180–204 CrossRef
Yu C, Siu M, Lam K, Tai F (1981) Adaptive clustering schemes: general framework. In: Proceedings of the IEEE COMPSAC conference, pp 81–89
Zhang J, Wang Y, Wang C, Zhou M (2017) Fast variable structure stochastic automaton for discovering and tracking spatiotemporal event patterns. IEEE Trans Cybern 48:890–903 CrossRef
- On enhancing the deadlock-preventing object migration automaton using the pursuit paradigm
B. John Oommen
- Springer London
Pattern Analysis and Applications
Print ISSN: 1433-7541
Elektronische ISSN: 1433-755X
Neuer Inhalt/© ITandMEDIA