{"product_id":"learning-automata-and-their-applications-to-intelligent-systems-isbn-9781394188499","title":"Learning Automata and Their Applications to Intelligent Systems","description":"\u003cp\u003e\u003cb\u003eComprehensive guide on learning automata, introducing two variants to accelerate convergence and computational update speed\u003c\/b\u003e \u003c\/p\u003e\u003cp\u003e\u003ci\u003eLearning Automata and Their Applications to Intelligent Systems\u003c\/i\u003e provides a comprehensive guide on learning automata from the perspective of principles, algorithms, improvement directions, and applications. The text introduces two variants to accelerate the convergence speed and computational update speed, respectively; these two examples demonstrate how to design new learning automata for a specific field from the aspect of algorithm design to give full play to the advantage of learning automata. \u003c\/p\u003e\u003cp\u003eAs noisy optimization problems exist widely in various intelligent systems, this book elaborates on how to employ learning automata to solve noisy optimization problems from the perspective of algorithm design and application. \u003c\/p\u003e\u003cp\u003eThe existing and most representative applications of learning automata include classification, clustering, game, knapsack, network, optimization, ranking, and scheduling. They are well-discussed. Future research directions to promote an intelligent system are suggested. \u003c\/p\u003e\u003cp\u003eWritten by two highly qualified academics with significant experience in the field, \u003ci\u003eLearning Automata and Their Applications to Intelligent Systems\u003c\/i\u003e covers such topics as: \u003c\/p\u003e\u003cul\u003e \u003cli\u003eMathematical analysis of the behavior of learning automata, along with suitable learning algorithms\u003c\/li\u003e \u003cli\u003eTwo application-oriented learning automata: one to discover and track spatiotemporal event patterns, and the other to solve stochastic searching on a line\u003c\/li\u003e \u003cli\u003eDemonstrations of two pioneering variants of Optimal Computing Budge Allocation (OCBA) methods and how to combine learning automata with ordinal optimization\u003c\/li\u003e \u003cli\u003eHow to achieve significantly faster convergence and higher accuracy than classical pursuit schemes via lower computational complexity of updating the state probability\u003c\/li\u003e\n\u003c\/ul\u003e\u003cp\u003eA timely text in a rapidly developing field, \u003ci\u003eLearning Automata and Their Applications to Intelligent Systems\u003c\/i\u003e is an essential resource for researchers in machine learning, engineering, operation, and management. The book is also highly suitable for graduate level courses on machine learning, soft computing, reinforcement learning and stochastic optimization. \u003c\/p\u003e\u003cp\u003eAbout the Authors ix\u003c\/p\u003e \u003cp\u003ePreface xi\u003c\/p\u003e \u003cp\u003eAcknowledgments xiii\u003c\/p\u003e \u003cp\u003eA Guide to Reading this Book xv\u003c\/p\u003e \u003cp\u003eOrganization of the Book xvii\u003c\/p\u003e \u003cp\u003e\u003cb\u003e1 Introduction 1\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e1.1 Ranking and Selection in Noisy Optimization 2\u003c\/p\u003e \u003cp\u003e1.2 Learning Automata and Ordinal Optimization 5\u003c\/p\u003e \u003cp\u003e1.3 Exercises 7\u003c\/p\u003e \u003cp\u003e\u003cb\u003e2 Learning Automata 9\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e2.1 Environment and Automaton 9\u003c\/p\u003e \u003cp\u003e2.1.1 Environment 9\u003c\/p\u003e \u003cp\u003e2.1.2 Automaton 10\u003c\/p\u003e \u003cp\u003e2.1.3 Deterministic and Stochastic Automata 11\u003c\/p\u003e \u003cp\u003e2.1.4 Measured Norms 15\u003c\/p\u003e \u003cp\u003e2.2 Fixed Structure Learning Automata 16\u003c\/p\u003e \u003cp\u003e2.2.1 Tsetlin Learning Automaton 16\u003c\/p\u003e \u003cp\u003e2.2.2 Krinsky Learning Automaton 18\u003c\/p\u003e \u003cp\u003e2.2.3 Krylov Learning Automaton 19\u003c\/p\u003e \u003cp\u003e2.2.4 IJA Learning Automaton 20\u003c\/p\u003e \u003cp\u003e2.3 Variable Structure Learning Automata 21\u003c\/p\u003e \u003cp\u003e2.3.1 Estimator-Free Learning Automaton 22\u003c\/p\u003e \u003cp\u003e2.3.2 Deterministic Estimator Learning Automaton 24\u003c\/p\u003e \u003cp\u003e2.3.3 Stochastic Estimator Learning Automaton 26\u003c\/p\u003e \u003cp\u003e2.4 Summary 27\u003c\/p\u003e \u003cp\u003e2.5 Exercises 28\u003c\/p\u003e \u003cp\u003e\u003cb\u003e3 Fast Learning Automata 31\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e3.1 Last-position Elimination-based Learning Automata 31\u003c\/p\u003e \u003cp\u003e3.1.1 Background and Motivation 32\u003c\/p\u003e \u003cp\u003e3.1.2 Principles and Algorithm Design 35\u003c\/p\u003e \u003cp\u003e3.1.3 Difference Analysis 37\u003c\/p\u003e \u003cp\u003e3.1.4 Simulation Studies 40\u003c\/p\u003e \u003cp\u003e3.1.5 Summary 45\u003c\/p\u003e \u003cp\u003e3.2 Fast Discretized Pursuit Learning Automata 46\u003c\/p\u003e \u003cp\u003e3.2.1 Background and Motivation 46\u003c\/p\u003e \u003cp\u003e3.2.2 Algorithm Design of Fast Discretized Pursuit LAs 48\u003c\/p\u003e \u003cp\u003e3.2.3 Optimality Analysis 54\u003c\/p\u003e \u003cp\u003e3.2.4 Simulation Studies 59\u003c\/p\u003e \u003cp\u003e3.2.5 Summary 63\u003c\/p\u003e \u003cp\u003e3.3 Exercises 63\u003c\/p\u003e \u003cp\u003e\u003cb\u003e4 Application-Oriented Learning Automata 67\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e4.1 Discovering and Tracking Spatiotemporal Event Patterns 67\u003c\/p\u003e \u003cp\u003e4.1.1 Background and Motivation 69\u003c\/p\u003e \u003cp\u003e4.1.2 Spatiotemporal Pattern Learning Automata 70\u003c\/p\u003e \u003cp\u003e4.1.3 Adaptive Tunable Spatiotemporal Pattern Learning Automata 73\u003c\/p\u003e \u003cp\u003e4.1.4 Optimality Analysis 76\u003c\/p\u003e \u003cp\u003e4.1.5 Simulation Studies 83\u003c\/p\u003e \u003cp\u003e4.1.6 Summary 89\u003c\/p\u003e \u003cp\u003e4.2 Stochastic Searching on the Line 89\u003c\/p\u003e \u003cp\u003e4.2.1 Background and Motivation 89\u003c\/p\u003e \u003cp\u003e4.2.2 Symmetrical Hierarchical Stochastic Searching on the Line 95\u003c\/p\u003e \u003cp\u003e4.2.3 Simulation Studies 99\u003c\/p\u003e \u003cp\u003e4.2.4 Summary 104\u003c\/p\u003e \u003cp\u003e4.3 Fast Adaptive Search on the Line in Dual Environments 104\u003c\/p\u003e \u003cp\u003e4.3.1 Background and Motivation 109\u003c\/p\u003e \u003cp\u003e4.3.2 Symmetrized ASS with Buffer 111\u003c\/p\u003e \u003cp\u003e4.3.3 Simulation Studies 114\u003c\/p\u003e \u003cp\u003e4.3.4 Summary 118\u003c\/p\u003e \u003cp\u003e4.4 Exercises 118\u003c\/p\u003e \u003cp\u003e\u003cb\u003e5 Ordinal Optimization 123\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e5.1 Optimal Computing-Budget Allocation 123\u003c\/p\u003e \u003cp\u003e5.2 Optimal Computing-Budget Allocation for Selection of Best and Worst Designs 125\u003c\/p\u003e \u003cp\u003e5.2.1 Background and Motivation 125\u003c\/p\u003e \u003cp\u003e5.2.2 Approximate Optimal Simulation Budget Allocation 126\u003c\/p\u003e \u003cp\u003e5.2.3 Simulation Studies 138\u003c\/p\u003e \u003cp\u003e5.2.4 Summary 150\u003c\/p\u003e \u003cp\u003e5.3 Optimal Computing-Budget Allocation for Subset Ranking 151\u003c\/p\u003e \u003cp\u003e5.3.1 Background and Motivation 151\u003c\/p\u003e \u003cp\u003e5.3.2 Approximate Optimal Simulation Budget Allocation 153\u003c\/p\u003e \u003cp\u003e5.3.3 Simulation Studies 159\u003c\/p\u003e \u003cp\u003e5.3.4 Summary 167\u003c\/p\u003e \u003cp\u003e5.4 Exercises 167\u003c\/p\u003e \u003cp\u003e\u003cb\u003e6 Incorporation of Ordinal Optimization into Learning Automata 175\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e6.1 Background and Motivation 175\u003c\/p\u003e \u003cp\u003e6.2 Learning Automata with Optimal Computing Budget Allocation 178\u003c\/p\u003e \u003cp\u003e6.3 Proof of Optimality 182\u003c\/p\u003e \u003cp\u003e6.4 Simulation Studies 187\u003c\/p\u003e \u003cp\u003e6.5 Summary 193\u003c\/p\u003e \u003cp\u003e6.6 Exercises 193\u003c\/p\u003e \u003cp\u003e\u003cb\u003e7 Noisy Optimization Applications 199\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e7.1 Background and Motivation 200\u003c\/p\u003e \u003cp\u003e7.2 Particle Swarm Optimization 202\u003c\/p\u003e \u003cp\u003e7.2.1 Parameters Configurations 203\u003c\/p\u003e \u003cp\u003e7.2.2 Topology Structures 203\u003c\/p\u003e \u003cp\u003e7.2.3 Hybrid PSO 203\u003c\/p\u003e \u003cp\u003e7.2.4 Multiswarm Techniques 204\u003c\/p\u003e \u003cp\u003e7.3 Resampling for Noisy Optimization Problems 204\u003c\/p\u003e \u003cp\u003e7.4 PSO-Based LA and OCBA 205\u003c\/p\u003e \u003cp\u003e7.5 Simulations Studies 209\u003c\/p\u003e \u003cp\u003e7.6 Summary 223\u003c\/p\u003e \u003cp\u003e7.7 Exercises 224\u003c\/p\u003e \u003cp\u003e\u003cb\u003e8 Applications and Future Research Directions of Learning Automata 231\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e8.1 Summary of Existing Applications 231\u003c\/p\u003e \u003cp\u003e8.1.1 Classification 231\u003c\/p\u003e \u003cp\u003e8.1.2 Clustering 233\u003c\/p\u003e \u003cp\u003e8.1.3 Games 233\u003c\/p\u003e \u003cp\u003e8.1.4 Knapsack Problems 234\u003c\/p\u003e \u003cp\u003e8.1.5 Decision Problems in Networks 235\u003c\/p\u003e \u003cp\u003e8.1.6 Optimization 236\u003c\/p\u003e \u003cp\u003e8.1.7 LA Parallelization and Design Ranking 238\u003c\/p\u003e \u003cp\u003e8.1.8 Scheduling 240\u003c\/p\u003e \u003cp\u003e8.2 Future Research Directions 241\u003c\/p\u003e \u003cp\u003e8.3 Exercises 243\u003c\/p\u003e \u003cp\u003eReferences 243\u003c\/p\u003e \u003cp\u003eIndex 249\u003c\/p\u003e  \u003cp\u003e\u003cb\u003eJunQi Zhang,\u003c\/b\u003e PhD, is a Full Professor with Tongji University in Shanghai. He has published 10+ papers in IEEE Transactions and 30+ papers in conferences. His current research interests include learning automata, swarm intelligence, swarm robots, multi-agent systems, reinforcement learning, and big data. \u003c\/p\u003e\u003cp\u003e\u003cb\u003eMengChu Zhou, \u003c\/b\u003ePhD, is a Distinguished Professor at New Jersey Institute of Technology. He has over 1100 publications including 14 books, 750+ journal papers (600+ in IEEE transactions), 31 patents, and 32 book-chapters. He is Fellow of IEEE, IFAC, AAAS, CAA and NAI.   \u003c\/p\u003e\u003cp\u003e\u003cb\u003eComprehensive guide on learning automata, introducing two variants to accelerate convergence and computational update speed\u003c\/b\u003e \u003c\/p\u003e\u003cp\u003e\u003ci\u003eLearning Automata and Their Applications to Intelligent Systems\u003c\/i\u003e provides a comprehensive guide on learning automata from the perspective of principles, algorithms, improvement directions, and applications. The text introduces two variants to accelerate the convergence speed and computational update speed, respectively; these two examples demonstrate how to design new learning automata for a specific field from the aspect of algorithm design to give full play to the advantage of learning automata. \u003c\/p\u003e\u003cp\u003eAs noisy optimization problems exist widely in various intelligent systems, this book elaborates on how to employ learning automata to solve noisy optimization problems from the perspective of algorithm design and application. \u003c\/p\u003e\u003cp\u003eThe existing and most representative applications of learning automata include classification, clustering, game, knapsack, network, optimization, ranking, and scheduling. They are well-discussed. Future research directions to promote an intelligent system are suggested. \u003c\/p\u003e\u003cp\u003eWritten by two highly qualified academics with significant experience in the field, \u003ci\u003eLearning Automata and Their Applications to Intelligent Systems\u003c\/i\u003e covers such topics as: \u003c\/p\u003e\u003cul\u003e\n\u003cli\u003eMathematical analysis of the behavior of learning automata, along with suitable learning algorithms\u003c\/li\u003e \u003cli\u003eTwo application-oriented learning automata: one to discover and track spatiotemporal event patterns, and the other to solve stochastic searching on a line\u003c\/li\u003e \u003cli\u003eDemonstrations of two pioneering variants of Optimal Computing Budge Allocation (OCBA) methods and how to combine learning automata with ordinal optimization\u003c\/li\u003e \u003cli\u003eHow to achieve significantly faster convergence and higher accuracy than classical pursuit schemes via lower computational complexity of updating the state probability\u003c\/li\u003e \u003c\/ul\u003e \u003cp\u003eA timely text in a rapidly developing field, \u003ci\u003eLearning Automata and Their Applications to Intelligent Systems\u003c\/i\u003e is an essential resource for researchers in machine learning, engineering, operation, and management. The book is also highly suitable for graduate level courses on machine learning, soft computing, reinforcement learning and stochastic optimization.\u003c\/p\u003e","brand":"Wiley-IEEE Press","offers":[{"title":"Default Title","offer_id":47989521055973,"sku":"NP9781394188499","price":145.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/1842\/7735\/files\/9781394188499.jpg?v=1761784441","url":"https:\/\/k12savings.com\/products\/learning-automata-and-their-applications-to-intelligent-systems-isbn-9781394188499","provider":"K12savings","version":"1.0","type":"link"}