Improvement of Automated Learning Methods based on Linear Learning Algorithms

Authors

  • farzad kiani istanbul sabahattin zaim university

Keywords:

Automated learning, linear learning, smart systems, reinforcement learning

Abstract

In recent years, the process of learning creatures is converted to one of the new research area. These researches are divided into two general categories that one of them is based on proposing a solution and learning based methodology to any machines. Learning is defined as changes made in the performance of a system based on experiences. The most prominent features of learning-based systems are that they improve themselves over time. Therefore, learning based machines have a big role in these systems. However, they are not very productive in some application and research areas such as smart real time systems especially. In this paper is proposed a new approach based on reinforcement learning technique that has three versions in order to implementation in different areas. It behaviors based on reward and penalty model. The effectiveness of these interactions with the environment is evaluated by the maximum (minimum) of the number of rewards (penalty) taken from the environment. The main advantage of the reinforcement learning over other learning methods is the need for no information from the environment (except amplification signal). The other learning methods as supervised or unsupervised are not appropriate to these problems. In this method, each agent decides the next its actions based on current k-actions instead of one action. The three versions are simple, sequential and unstructured linear learning methods so they evaluated in different possibilities to get the appropriate responses. Depending on the needs of any system, they can be used. The mode of convergence of actions in the proposed automaton (machine) in six different scenarios is examined.  

References

V. Saritha, P. V. Krishna, S. Misra and M.S. Obaidat, “Learning Automata based Optimized Multipath routing using Leapfrog Algorithm for VANETs”, IEEE ICC 2017 Mobile and Wireless Networking, 1-5, 2017. https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=7997401

K. S. Narendra and M. A. L. Thathachar, “Learning automata: An introduction”, Proceedings of the Prentice Hall, 1989.https://dl.acm.org/citation.cfm?id=64802

Z. Shariyat, A. Movaghar, M. Hoseinzadeh, “A learning automata and clustering-based routing protocol for named data networking”, Telecommunications Systems, 65(1), 9-29, 2017. https://link.springer.com/article/10.1007/s11235-016-0209-8

H. Ge and Sh. Li, “A Parameter-Free Learning Automaton Scheme”, Cornell University Library, 1-13, 2017. https://arxiv.org/pdf/1711.10111.pdf

E. Mance and S. H. Stephanie, “Reinforcement learning: A tutorial”, Proceedings of the Wright Laboratory, 1996.http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.33.2480&rep=rep1&type=pdf

K. Arulkuraman, M. Peter, M. Brundage and A. Bharath, “Deep Reinforcement Learning: A brief survey”, IEEE Signal Processing Magazine, 26-38, 2017.https://ieeexplore.ieee.org/document/8103164/

K. S. Fu and T. J. Li, “Formulation of learning automata and automata games”, Proceedings of the Information Science, 1(3), 237-256, 1969.https://www.sciencedirect.com/science/article/pii/S0020025569800101

C. S. Chasparis, “Stochastic Stability of Perturbed Learning Automata in Positive-Utility Games”, 1-16, 2018, https://arxiv.org/pdf/1709.05859.pdf

A. Jitpattanakul, “Learning k-edge Deterministic Finite Automata in the Framework of Active Learning”, International Journal of Applied Engineering Research, International Journal of Applied Engineering Research, 12(6), 6050-6054, 2017. https://pdfs.semanticscholar.org/ef37/f0bf558148dd2b830abdd4dfbb406b50e2f7.pdf

R. W. McLaren, “A stochastic automaton model for synthesis of learning systems”, Proceedings of the IEEE Transactions on System Science and Cybernetics, 2, 109-114, 1966.https://link.springer.com/chapter/10.1007/978-1-4615-9050-7_5

O. Christoffer, S.Glimsdal, “Accelerated Bayesian learning for decentralized two-armed bandit based decision making with applications to the Goore Game”,ApplIntell, Springer Science and Business Media, LLC 2012, 1-10, 2012. https://brage.bibsys.no/xmlui/bitstream/handle/11250/137969/Granmo_2012_Accelerated.pdf?sequence=1

S. Tanwer et al., “LA-MHR: Learning Automata Based Multilevel Heterogeneous Routing for Opportunistic Shared Spectrum Access to Enhance Lifetime of WSN”, IEEE Systems Journal, 1-11, 2018. https://ieeexplore.ieee.org/document/8351993/

D. Mendez, I. Papapanagiotou, B. Yang, “Internet of Things: Survey on Security and Privacy”, 1-15, 2017, https://arxiv.org/pdf/1707.01879.pdf

R. Thapa et al., “A Learning Automaton-Based Scheme for Scheduling Domestic Shiftable Loads in Smart Grids”, IEEE Access, 6, 5348-5361, 2017. https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8241784

Published

2018-06-07

How to Cite

kiani, farzad. (2018). Improvement of Automated Learning Methods based on Linear Learning Algorithms. International Journal of Machine Learning and Networked Collaborative Engineering, 2(02), 67–74. Retrieved from http://mlnce.net/index.php/Home/article/view/31