Search results for "Optimization Algorithms for Machine Learning"
Items we need to order for you
Classical and Evolutionary Algorithms in the Optimization of Optical Systems
The optimization of optical systems is a very old problem. As soon as lens designers discovered the possibility of designing optical systems, the desire to improve those systems by the means of optimization began. For a long time the optimization of optical systems was connected with well-known mathematical theories of optimization which gave good results, but required lens designers to have a strong knowledge about optimized optical systems. In recent years modern optimization methods have been developed that are not primarily based on the known mathematical theories of optimization, but rather on analogies with nature. While searching for successful optimization methods, scientists noticed that the method of organic evolution (well-known Darwinian theory of evolution) represented an optimal strategy of adaptation of living organisms to their changing environment. If the method of organic evolution was very successful in nature, the principles of the biological evolution could be applied to the problem of optimization of complex technical systems.
R 1,555.49
Vector Optimization with Infimum and Supremum
The theory of Vector Optimization is developed by a systematic usage of infimum and supremum. In order to get existence and appropriate properties of the infimum, the image space of the vector optimization problem is embedded into a larger space, which is a subset of the power set, in fact, the space of self-infimal sets. Based on this idea we establish solution concepts, existence and duality results and algorithms for the linear case. The main advantage of this approach is the high degree of analogy to corresponding results of Scalar Optimization. The concepts and results are used to explain and to improve practically relevant algorithms for linear vector optimization problems.
R 3,832.13
Approximation Algorithms for Combinatorial Optimization
The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e?cient approximate solutions to computationally d- ?cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the ?eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc .. ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ?ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications.The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R.
R 2,327.32
Deep Learning for Computer Vision
Learn how to model and train advanced neural networks to implement a variety of Computer Vision tasksKey Features Train different kinds of deep learning model from scratch to solve specific problems in Computer Vision Combine the power of Python, Keras, and TensorFlow to build deep learning models for object detection, image classification, similarity learning, image captioning, and more Includes tips on optimizing and improving the performance of your models under various constraintsBook DescriptionDeep learning has shown its power in several application areas of Artificial Intelligence, especially in Computer Vision. Computer Vision is the science of understanding and manipulating images, and finds enormous applications in the areas of robotics, automation, and so on. This book will also show you, with practical examples, how to develop Computer Vision applications by leveraging the power of deep learning. In this book, you will learn different techniques related to object classification, object detection, image segmentation, captioning, image generation, face analysis, and more. You will also explore their applications using popular Python libraries such as TensorFlow and Keras. This book will help you master state-of-the-art, deep learning algorithms and their implementation.What you will learnSet up an environment for deep learning with Python, TensorFlow, and KerasDefine and train a model for image and video classificationUse features from a pre-trained Convolutional Neural Network model for image retrievalUnderstand and implement object detection using the real-world Pedestrian Detection scenarioLearn about various problems in image captioning and how to overcome them by training images and text togetherImplement similarity matching and train a model for face recognitionUnderstand the concept of generative models and use them for image generationDeploy your deep learning models and optimize them for high performanceWho this book is forThis book is targeted at data scientists and Computer Vision practitioners who wish to apply the concepts of Deep Learning to overcome any problem related to Computer Vision. A basic knowledge of programming in Python—and some understanding of machine learning concepts—is required to get the best out of this book.
R 1,498.00
Introduction to Cutting and Packing Optimization
This book provides a comprehensive overview of the most important and frequently considered optimization problems concerning cutting and packing. Based on appropriate modeling approaches for the problems considered, it offers an introduction to the related solution methods. It also addresses aspects like performance results for heuristic algorithms and bounds of the optimal value, as well as the packability of a given set of objects within a predefined container. The problems discussed arise in a wide variety of different fields of application and research, and as such, the fundamental knowledge presented in this book make it a valuable resource for students, practitioners, and researchers who are interested in dealing with such tasks.
R 5,438.59
Combinatorial Optimization
There have been significant developments in the theory and practice of combinatorial optimization in the last 15 years. This progress has been evidenced by a continuously increasing number of international and local conferences, books and papers in this area. This book is also another contribution to this burgeoning area of operations research and optimization. This volume contains the contributions of the participants of the recent NATO Ad vanced Study Institute, New Frontiers in the Theory and Practice of Combinatorial Op timization, which was held at the campus of Bilkent University, in Ankara, Turkey, July 16-29, 1990. In this conference, we brought many prominent researchers and young and promising scientists together to discuss current and future trends in the theory and prac tice of combinatorial optimization. The Bilkent campus was an excellent environment for such an undertaking. Being outside of Ankara, the capital of Turkey, Bilkent University gave the participants a great opportunity for exchanging ideas and discussing new theories and applications without much distraction. One of the primary goals of NATO ASIs is to bring together a group of scientists and research scientists primarily from the NATO countries for the dissemination of ad vanced scientific knowledge and the promotion of international contacts among scientists. We believe that we accomplished this mission very successfully by bringing together 15 prominent lecturers and 45 promising young scientists from 12 countries, in a university environment for 14 days of intense lectures, presentations and discussions.
R 3,168.27
Trustworthy Machine Learning under Imperfect Data
The subject of this book centresaround trustworthy machine learning under imperfect data. It is primarily designed forscientists, researchers, practitioners, professionals, postgraduates andundergraduates in thefield of machine learning and artificial intelligence. The book focuseson trustworthy deep learning under various types of imperfect data, includingnoisy labels, adversarial examples, and out-of-distribution data. It coverstrustworthy machine learning algorithms, theories, and systems. The main goal of the book is to provide students and researchers in academia with anunbiased and comprehensive literature review. More importantly, it aims to stimulateinsightful discussions about the future of trustworthy machine learning. By engaging the audiencein more in-depth conversations, the book intends to spark ideas for addressing coreproblems in this topic. For example, it will explore how to build up benchmark datasets innoisy-supervised learning, how to tackle the emerging adversarial learning, andhow to tackle out-of-distribution detection. For practitioners in the industry, this book will present state-of-the-art trustworthy machine learning methods tohelp them solve real-world problems in different scenarios, such as onlinerecommendation and web search. While the book will introduce the basics ofknowledge required, readers will benefit from having some familiarity withlinear algebra, probability, machine learning, and artificial intelligence. Theemphasis will be on conveying the intuition behind all formal concepts, theories, and methodologies, ensuring the book remains self-contained at a highlevel.
R 7,583.62
Advances in Optimization and Linear Programming
This new volume provides the information needed to understand the simplex method, the revised simplex method, dual simplex method, and more for solving linear programming problems.Following a logical order, the book first gives a mathematical model of the linear problem programming and describes the usual assumptions under which the problem is solved. It gives a brief description of classic algorithms for solving linear programming problems as well as some theoretical results. It goes on to explain the definitions and solutions of linear programming problems, outlining the simplest geometric methods and showing how they can be implemented. Practical examples are included along the way. The book concludes with a discussion of multi-criteria decision-making methods.Advances in Optimization and Linear Programming is a highly useful guide to linear programming for professors and students in optimization and linear programming.
R 5,983.61
R 5,465.00
Combinatorial Optimization and Applications
This volume constitutes the proceedings of the 14th International Conference on Combinatorial Optimization and Applications, COCOA 2020, held in Dallas, TX, USA, in December 2020. The 55 full papers presented in this volume were carefully reviewed and selected from 104 submissions. The papers are grouped into the following topics: Approximation Algorithms; Scheduling; Network Optimization; Complexity and Logic; Search, Facility and Graphs; Geometric Problem; Sensors, Vehicles and Graphs; and Graph Problems. Due to the Corona pandemic this event was held virtually.
R 4,361.55
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more.
R 3,093.02
Metaheuristics Algorithms for Medical Applications
Metaheuristics Algorithms for Medical Applications: Methods and Applications provides readers with the most complete reference for developing metaheuristics techniques with machine learning for solving biomedical problems. This book is organized to present a stepwise progression beginning with the basics of metaheuristics, leading into methods and practices, and concluding with advanced topics. The first section of this book presents the fundamental concepts of metaheuristics and machine learning and provides a comprehensive taxonomic view of metaheuristics methods according to a variety of criteria such as data type, scope, and method. The second section of this book explains how to apply metaheuristics techniques for solving large-scale biomedical problems, including analysis and validation under different strategies. The final portion of the book focuses on advanced topics in metaheuristics in four different applications. Readers will discover a variety of new methods, approaches, and techniques, as well as a wide range of applications demonstrating key concepts in metaheuristics for biomedical science. This book provides a leading-edge resource for researchers in a variety of scientific fields who are interested in metaheuristics, including mathematics, biomedical engineering, computer science, biological sciences, and clinicians in medical practice.
R 5,297.00
Essays and Surveys in Global Optimization
Global optimization aims at solving the most general problems of deterministic mathematical programming: to find the global optimum of a nonlinear, nonconvex, multivariate function of continuous and/or integer variables subject to constraints which may be themselves nonlinear and nonconvex. In addition, once the solutions are found, proof of its optimality is also expected from this methodology. Therefore, with these difficulties in mind, global optimization is becoming an increasingly powerful and important methodology. Essays and Surveys in Global Optimization is the most recent examination of its mathematical capability, power, and wide ranging solutions to many fields in the applied sciences.
R 3,578.33
Adversarial Robustness for Machine Learning
Adversarial Robustness for Machine Learning summarizes the recent progress on this topic and introduces popular algorithms on adversarial attack, defense and veri?cation. Sections cover adversarial attack, veri?cation and defense, mainly focusing on image classi?cation applications which are the standard benchmark considered in the adversarial robustness community. Other sections discuss adversarial examples beyond image classification, other threat models beyond testing time attack, and applications on adversarial robustness. For researchers, this book provides a thorough literature review that summarizes latest progress in the area, which can be a good reference for conducting future research. In addition, the book can also be used as a textbook for graduate courses on adversarial robustness or trustworthy machine learning. While machine learning (ML) algorithms have achieved remarkable performance in many applications, recent studies have demonstrated their lack of robustness against adversarial disturbance. The lack of robustness brings security concerns in ML models for real applications such as self-driving cars, robotics controls and healthcare systems.
R 3,237.00
Applied Optimization Methods for Wireless Networks
Written in a unique style, this book is a valuable resource for faculty, graduate students, and researchers in the communications and networking area whose work interfaces with optimization. It teaches you how various optimization methods can be applied to solve complex problems in wireless networks. Each chapter reviews a specific optimization method and then demonstrates how to apply the theory in practice through a detailed case study taken from state-of-the-art research. You will learn various tips and step-by-step instructions for developing optimization models, reformulations, and transformations, particularly in the context of cross-layer optimization problems in wireless networks involving flow routing (network layer), scheduling (link layer), and power control (physical layer). Throughout, a combination of techniques from both operations research and computer science disciplines provides a holistic treatment of optimization methods and their applications. Each chapter includes homework exercises, with PowerPoint slides and a solutions manual for instructors available online.
R 2,852.71
Optimal Quadratic Programming and QCQP Algorithms with Applications
This book presents cutting-edge algorithms for solving large-scale quadratic programming (QP) and/or QCQP. While applying these algorithms to the class of QP problems with the spectrum confined to a positive interval, the theory guarantees finding the prescribed precision solution through a uniformly bounded number of simple iterations, like matrix-vector multiplications. Key concepts explored include the active set strategy, spectral gradients, and augmented Lagrangian methods. The book provides a comprehensive quantitative convergence theory, avoiding unspecified constants. Through detailed numerical experiments, the author demonstrates the algorithms' superior performance compared to traditional methods, especially in handling large problems with sparse Hessian. The performance of the algorithms is shown on large-scale (billions of variables) problems of mechanics, optimal control, and support vector machines. Ideal for researchers and practitioners in optimization and computational mathematics, this volume is also an introductory text and a reference for advanced studies in nonlinear programming. Whether you're a scholar in applied mathematics or an engineer tackling complex optimization challenges, this book offers valuable insights and practical tools for your work.
R 7,430.06
Optimization and Data Science in Industrial Engineering
This two-volume set CCIS 2204 and 2205 constitutes the refereed proceedings of the First International Conference on Optimization and Data Science in Industrial Engineering, ODSIE 2023, held in Istanbul, Turkey, during November 16–17, 2023.The 33 full papers and 2 short papers presented in these proceedings were carefully reviewed and selected from 311 submissions.The papers were organized in the following topical sections:Part I: smart and intelligent transportation systems; machine/deep/reinforcement learning in industries; and advances of artificial intelligence/operational research tools in healthcare.Part II: technology, learning and analytics in intelligent systems; expert systems, decision analysis, and advanced optimization; digital transformation of supply chain and logistics systems.
R 3,331.47
Evolutionary Multi-Criterion Optimization
This book constitutes the refereed proceedings of the First International Conference on Multi-Criterion Optimization, EMO 2001, held in Zurich, Switzerland in March 2001.The 45 revised full papers presented were carefully reviewed and selected from a total of 87 submissions. Also included are two tutorial surveys and two invited papers. The book is organized in topical sections on algorithm improvements, performance assessment and comparison, constraint handling and problem decomposition, uncertainty and noise, hybrid and alternative methods, scheduling, and applications of multi-objective optimization in a variety of fields.
R 4,030.00
Nature Inspired Cooperative Strategies for Optimization (NICSO 2013)
Biological and other natural processes have always been a source of inspiration for computer science and information technology. Many emerging problem solving techniques integrate advanced evolution and cooperation strategies, encompassing a range of spatio-temporal scales for visionary conceptualization of evolutionary computation.This book is a collection of research works presented in the VI International Workshop on Nature Inspired Cooperative Strategies for Optimization (NICSO) held in Canterbury, UK. Previous editions of NICSO were held in Granada, Spain (2006 & 2010), Acireale, Italy (2007), Tenerife, Spain (2008), and Cluj-Napoca, Romania (2011). NICSO 2013 and this book provides a place where state-of-the-art research, latest ideas and emerging areas of nature inspired cooperative strategies for problem solving are vigorously discussed and exchanged among the scientific community. The breadth and variety of articles in this book report on nature inspired methods and applications such as Swarm Intelligence, Hyper-heuristics, Evolutionary Algorithms, Cellular Automata, Artificial Bee Colony, Dynamic Optimization, Support Vector Machines, Multi-Agent Systems, Ant Clustering, Evolutionary Design Optimisation, Game Theory and other several Cooperation Models.
R 7,361.64
Optimal Algorithms
This volume brings together papers from various fields of theoretical computer science, including computational geometry, parallel algorithms, algorithms on graphs, data structures and complexity of algorithms. Some of the invited papers include surveys of results in particular fields and some report original research, while all the contributed papers report original research. Most of the algorithms given are for parallel models of computation. The papers were presented at the Second International Symposium on Optimal Algorithms held in Varna, Bulgaria, in May/June 1989. The volume will be useful to researchers and students in theoretical computer science, especially in parallel computing.
R 1,559.44
R 825.00
Advances in Optimization and Applications
This book constitutes the refereed proceedings of the 13th International Conference on Advances in Optimization and Applications, OPTIMA 2022, held in Petrovac, Montenegro, during September 26–30, 2022. The 13 full papers included in this book were carefully reviewed and selected from 26 submissions. They were organized in topical sections as follows: mathematical programming; global optimization; discrete and combinatorial optimization; optimization and data analysis; game theory and mathematical economics; and applications.
R 2,731.65
R 4,732.00
Genetic Algorithms and Machine Learning for Programmers
Self-driving cars, natural language recognition, and online recommendation engines are all possible thanks to Machine Learning. Now you can create your own genetic algorithms, nature-inspired swarms, Monte Carlo simulations, cellular automata, and clusters. Learn how to test your ML code and dive into even more advanced topics. If you are a beginner-to-intermediate programmer keen to understand machine learning, this book is for you. Discover machine learning algorithms using a handful of self-contained recipes. Build a repertoire of algorithms, discovering terms and approaches that apply generally. Bake intelligence into your algorithms, guiding them to discover good solutions to problems. In this book, you will: Use heuristics and design fitness functions.Build genetic algorithms.Make nature-inspired swarms with ants, bees and particles.Create Monte Carlo simulations.Investigate cellular automata.Find minima and maxima, using hill climbing and simulated annealing.Try selection methods, including tournament and roulette wheels.Learn about heuristics, fitness functions, metrics, and clusters. Test your code and get inspired to try new problems. Work through scenarios to code your way out of a paper bag; an important skill for any competent programmer. See how the algorithms explore and learn by creating visualizations of each problem. Get inspired to design your own machine learning projects and become familiar with the jargon. What You Need: Code in C++ (>= C++11), Python (2.x or 3.x) and JavaScript (using the HTML5 canvas). Also uses matplotlib and some open source libraries, including SFML, Catch and Cosmic-Ray. These plotting and testing libraries are not required but their use will give you a fuller experience. Armed with just a text editor and compiler/interpreter for your language of choice you can still code along from the general algorithm descriptions.
R 1,590.00
Machine Learning Fundamentals
This lucid, accessible introduction to supervised machine learning presents core concepts in a focused and logical way that is easy for beginners to follow. The author assumes basic calculus, linear algebra, probability and statistics but no prior exposure to machine learning. Coverage includes widely used traditional methods such as SVMs, boosted trees, HMMs, and LDAs, plus popular deep learning methods such as convolution neural nets, attention, transformers, and GANs. Organized in a coherent presentation framework that emphasizes the big picture, the text introduces each method clearly and concisely “from scratch” based on the fundamentals. All methods and algorithms are described by a clean and consistent style, with a minimum of unnecessary detail. Numerous case studies and concrete examples demonstrate how the methods can be applied in a variety of contexts.
R 2,111.00
Introduction to Nonlinear and Global Optimization
This self-contained text provides a solid introduction to global and nonlinear optimization, providing students of mathematics and interdisciplinary sciences with a strong foundation in applied optimization techniques. The book offers a unique hands-on and critical approach to applied optimization which includes the presentation of numerous algorithms, examples, and illustrations, designed to improve the reader’s intuition and develop the analytical skills needed to identify optimization problems, classify the structure of a model, and determine whether a solution fulfills optimality conditions.
R 2,017.76
R 1,289.24
Introduction to Machine Learning
This textbook offers a comprehensive introduction to Machine Learning techniques and algorithms. This Third Edition covers newer approaches that have become highly topical, including deep learning, and auto-encoding, introductory information about temporal learning and hidden Markov models, and a much more detailed treatment of reinforcement learning. The book is written in an easy-to-understand manner with many examples and pictures, and with a lot of practical advice and discussions of simple applications. The main topics include Bayesian classifiers, nearest-neighbor classifiers, linear and polynomial classifiers, decision trees, rule-induction programs, artificial neural networks, support vector machines, boosting algorithms, unsupervised learning (including Kohonen networks and auto-encoding), deep learning, reinforcement learning, temporal learning (including long short-term memory), hidden Markov models, and the genetic algorithm. Special attention is devoted to performance evaluation, statistical assessment, and to many practical issues ranging from feature selection and feature construction to bias, context, multi-label domains, and the problem of imbalanced classes.
R 2,866.50
Handbook of Research on Machine Learning
This volume takes the reader on a technological voyage of machine learning advancements, highlighting the systematic changes in algorithms, challenges, and constraints. The technological advancements in the ML arena have transformed and revolutionized several fields, including transportation, agriculture, finance, weather monitoring, and others. This book brings together researchers, authors, industrialists, and academicians to cover a vast selection of topics in ML, starting with the rudiments of machine learning approaches and going on to specific applications in healthcare and industrial automation.The book begins with an overview of the ethics, security and privacy issues, future directions, and challenges in machine learning as well as a systematic review of deep learning techniques and provides an understanding of building generative adversarial networks. Chapters explore predictive data analytics for health issues. The book also adds a macro dimension by highlighting the industrial applications of machine learning, such as in the steel industry, for urban information retrieval, in garbage detection, in measuring air pollution, for stock market predictions, for underwater fish detection, as a fake news predictor, and more.
R 3,627.00
Combinatorial Optimization and Applications
This book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008. The 44 revised full papers were carefully reviewed and selected from 84 submissions. The papers feature original research in the areas of combinatorial optimization -- both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
R 2,015.00
Nonlinear Conjugate Gradient Methods for Unconstrained Optimization
Two approaches are known for solving large-scale unconstrained optimization problems—the limited-memory quasi-Newton method (truncated Newton method) and the conjugate gradient method. This is the first book to detail conjugate gradient methods, showing their properties and convergence characteristics as well as their performance in solving large-scale unconstrained optimization problems and applications. Comparisons to the limited-memory and truncated Newton methods are also discussed. Topics studied in detail include: linear conjugate gradient methods, standard conjugate gradient methods, acceleration of conjugate gradient methods, hybrid, modifications of the standard scheme, memoryless BFGS preconditioned, and three-term. Other conjugate gradient methods with clustering the eigenvalues or with the minimization of the condition number of the iteration matrix, are also treated. For each method, the convergence analysis, the computational performances and the comparisons versus other conjugate gradient methods are given. The theory behind the conjugate gradient algorithms presented as a methodology is developed with a clear, rigorous, and friendly exposition; the reader will gain an understanding of their properties and their convergence and will learn to develop and prove the convergence of his/her own methods. Numerous numerical studies are supplied with comparisons and comments on the behavior of conjugate gradient algorithms for solving a collection of 800 unconstrained optimization problems of different structures and complexities with the number of variables in the range [1000,10000]. The book is addressed to all those interested in developing and using new advanced techniques for solving unconstrained optimization complex problems. Mathematical programming researchers, theoreticians and practitioners in operations research, practitioners in engineering and industry researchers, as well as graduate students in mathematics, Ph.D. and master students in mathematical programming, will find plenty of information and practical applications for solving large-scale unconstrained optimization problems and applications by conjugate gradient methods.
R 5,001.03
R 1,636.66
Advances in Metaheuristics Algorithms: Methods and Applications
This book explores new alternative metaheuristic developments that have proved to be effective in their application to several complex problems. Though most of the new metaheuristic algorithms considered offer promising results, they are nevertheless still in their infancy. To grow and attain their full potential, new metaheuristic methods must be applied in a great variety of problems and contexts, so that they not only perform well in their reported sets of optimization problems, but also in new complex formulations. The only way to accomplish this is to disseminate these methods in various technical areas as optimization tools. In general, once a scientist, engineer or practitioner recognizes a problem as a particular instance of a more generic class, he/she can select one of several metaheuristic algorithms that guarantee an expected optimization performance. Unfortunately, the set of options are concentrated on algorithms whose popularity and high proliferation outstrip those of the new developments. This structure is important, because the authors recognize this methodology as the best way to help researchers, lecturers, engineers and practitioners solve their own optimization problems.
R 4,757.00
Modeling and Optimization: Theory and Applications
This volume contains a selection of contributions that were presented at the Modeling and Optimization: Theory and Applications Conference (MOPTA) held at Lehigh University in Bethlehem, Pennsylvania, USA on August 18-20, 2010. The conference brought together a diverse group of researchers and practitioners, working on both theoretical and practical aspects of continuous or discrete optimization. Topics presented included algorithms for solving convex, network, mixed-integer, nonlinear, and global optimization problems, and addressed the application of optimization techniques in finance, logistics, health, and other important fields. The contributions contained in this volume represent a sample of these topics and applications and illustrate the broad diversity of ideas discussed at the meeting.
R 4,245.02
Machine Learning Paradigms
At the dawn of the 4th Industrial Revolution, the field of Deep Learning (a sub-field of Artificial Intelligence and Machine Learning) is growing continuously and rapidly, developing both theoretically and towards applications in increasingly many and diverse other disciplines. The book at hand aims at exposing its reader to some of the most significant recent advances in deep learning-based technological applications and consists of an editorial note and an additional fifteen (15) chapters. All chapters in the book were invited from authors who work in the corresponding chapter theme and are recognized for their significant research contributions. In more detail, the chapters in the book are organized into six parts, namely (1) Deep Learning in Sensing, (2) Deep Learning in Social Media and IOT, (3) Deep Learning in the Medical Field, (4) Deep Learning in Systems Control, (5) Deep Learning in Feature Vector Processing, and (6) Evaluation of Algorithm Performance. This research book is directed towards professors, researchers, scientists, engineers and students in computer science-related disciplines. It is also directed towards readers who come from other disciplines and are interested in becoming versed in some of the most recent deep learning-based technological applications. An extensive list of bibliographic references at the end of each chapter guides the readers to probe deeper into their application areas of interest.
R 5,617.63
Applications of Machine Learning in Wireless Communications
Machine learning explores the study and development of algorithms that can learn from and make predictions and decisions based on data. Applications of machine learning in wireless communications have been receiving a lot of attention, especially in the era of big data and IoT, where data mining and data analysis technologies are effective approaches to solving wireless system evaluation and design issues. This edited book presents current and future developments and trends in wireless communication technologies based on contributions from machine learning and other fields of artificial intelligence, including channel modelling, signal estimation and detection, energy efficiency, cognitive radios, wireless sensor networks, vehicular communications, and wireless multimedia communications. The book is aimed at a readership of researchers, engineers and students working on wireless communications and machine learning, especially those working with big data and artificial intelligence multi-disciplinary fields related to wireless communication technologies.
R 4,844.00
Linear Programming and Algorithms for Communication Networks
Explaining how to apply to mathematical programming to network design and control, Linear Programming and Algorithms for Communication Networks: A Practical Guide to Network Design, Control, and Management fills the gap between mathematical programming theory and its implementation in communication networks. From the basics all the way through to more advanced concepts, its comprehensive coverage provides readers with a solid foundation in mathematical programming for communication networks. Addressing optimization problems for communication networks, including the shortest path problem, max flow problem, and minimum-cost flow problem, the book covers the fundamentals of linear programming and integer linear programming required to address a wide range of problems. It also: Examines several problems on finding disjoint paths for reliable communicationsAddresses optimization problems in optical wavelength-routed networksDescribes several routing strategies for maximizing network utilization for various traffic-demand modelsConsiders routing problems in Internet Protocol (IP) networksPresents mathematical puzzles that can be tackled by integer linear programming (ILP)Using the GNU Linear Programming Kit (GLPK) package, which is designed for solving linear programming and mixed integer programming problems, it explains typical problems and provides solutions for communication networks. The book provides algorithms for these problems as well as helpful examples with demonstrations. Once you gain an understanding of how to solve LP problems for communication networks using the GLPK descriptions in this book, you will also be able to easily apply your knowledge to other solvers.
R 7,566.32
Thermal System Design and Optimization
This highly informative and carefully presented textbook introduces the general principles involved in system design and optimization as applicable to thermal systems, followed by the methods to accomplish them. It introduces contemporary techniques like Genetic Algorithms, Simulated Annealing, and Bayesian Inference in the context of optimization of thermal systems. There is a separate chapter devoted to inverse problems in thermal systems. It also contains sections on Integer Programming and Multi-Objective optimization. The linear programming chapter is fortified by a detailed presentation of the Simplex method. A major highlight of the textbook is the inclusion of workable MATLAB codes for examples of key algorithms discussed in the book. Examples in each chapter clarify the concepts and methods presented and end-of-chapter problems supplement the material presented and enhance the learning process.
R 2,564.00
Discrete Cuckoo Search for Combinatorial Optimization
This book provides a literature review of techniques used to pass from continuous to combinatorial space, before discussing a detailed example with individual steps of how cuckoo search (CS) can be adapted to solve combinatorial optimization problems. It demonstrates the application of CS to three different problems and describes their source code. The content is divided into five chapters, the first of which provides a technical description, together with examples of combinatorial search spaces. The second chapter summarizes a diverse range of methods used to solve combinatorial optimization problems. In turn, the third chapter presents a description of CS, its formulation and characteristics. In the fourth chapter, the application of discrete cuckoo search (DCS) to solve three POCs (the traveling salesman problem, quadratic assignment problem and job shop scheduling problem) is explained, focusing mainly on a reinterpretation of the terminology used in CS and its source of inspiration. In closing, the fifth chapter discusses random-key cuckoo search (RKCS) using random keys to represent positions found by cuckoo search in the TSP and QAP solution space.
R 3,013.51
Well-Posed Optimization Problems
This book presents in a unified way the mathematical theory of well-posedness in optimization. The basic concepts of well-posedness and the links among them are studied, in particular Hadamard and Tykhonov well-posedness. Abstract optimization problems as well as applications to optimal control, calculus of variations and mathematical programming are considered. Both the pure and applied side of these topics are presented. The main subject is often introduced by heuristics, particular cases and examples. Complete proofs are provided. The expected knowledge of the reader does not extend beyond textbook (real and functional) analysis, some topology and differential equations and basic optimization. References are provided for more advanced topics. The book is addressed to mathematicians interested in optimization and related topics, and also to engineers, control theorists, economists and applied scientists who can find here a mathematical justification of practical procedures they encounter.
R 1,686.33
Practical Machine Learning for Computer Vision
This practical book shows you how to employ machine learning models to extract information from images. ML engineers and data scientists will learn how to solve a variety of image problems including classification, object detection, autoencoders, image generation, counting, and captioning with proven ML techniques. This book provides a great introduction to end-to-end deep learning: dataset creation, data preprocessing, model design, model training, evaluation, deployment, and interpretability.Google engineers Valliappa Lakshmanan, Martin Goerner, and Ryan Gillard show you how to develop accurate and explainable computer vision ML models and put them into large-scale production using robust ML architecture in a flexible and maintainable way. You'll learn how to design, train, evaluate, and predict with models written in TensorFlow or Keras.You'll learn how to:Design ML architecture for computer vision tasksSelect a model (such as ResNet, SqueezeNet, or EfficientNet) appropriate to your taskCreate an end-to-end ML pipeline to train, evaluate, deploy, and explain your modelPreprocess images for data augmentation and to support learnabilityIncorporate explainability and responsible AI best practicesDeploy image models as web services or on edge devicesMonitor and manage ML models
R 2,052.00
Evolutionary Computation in Combinatorial Optimization
This book constitutes the refereed proceedings of the 13th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2013, held in Vienna, Austria, in April 2013, colocated with the Evo* 2013 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. The 23 revised full papers presented were carefully reviewed and selected from 50 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics are ant colony optimization, evolutionary algorithms, greedy randomized adaptive search procedures, iterated local search, simulated annealing, tabu search, and variable neighborhood search. Applications include scheduling, timetabling, network design, transportation and distribution, vehicle routing, the travelling salesman problem, packing and cutting, satisfiability, and general mixed integer programming.
R 1,981.01
Machine Learning for the Physical Sciences
Machine learning is an exciting topic with a myriad of applications. However, most textbooks are targeted towards computer science students. This, however, creates a complication for scientists across the physical sciences that also want to understand the main concepts of machine learning and look ahead to applications and advancements in their fields. This textbook bridges this gap, providing an introduction to the mathematical foundations for the main algorithms used in machine learning for those from the physical sciences, without a formal background in computer science. It demonstrates how machine learning can be used to solve problems in physics and engineering, targeting senior undergraduate and graduate students in physics and electrical engineering, alongside advanced researchers. Key Features: Includes detailed algorithms. Supplemented by codes in Julia: a high-performing language and one that is easy to read for those in the natural sciences. All algorithms are presented with a good mathematical background.Carlo R. da Cunha is currently an assistant professor at the School of Informatics, Computing, and Cyber Systems at Northern Arizona University. He holds a Ph.D. degree in electrical engineering from Arizona State University. Throughout his career, Dr. da Cunha has held various academic positions and research affiliations in institutions such as McGill University, Chiba University, and the Technical University of Vienna. His research focuses on computational science, where he applies machine learning techniques to the design of innovative electronic devices and systems.
R 11,135.73
Model-Based Machine Learning
Today, machine learning is being applied to a growing variety of problems in a bewildering variety of domains. A fundamental challenge when using machine learning is connecting the abstract mathematics of a machine learning technique to a concrete, real world problem. This book tackles this challenge through model-based machine learning which focuses on understanding the assumptions encoded in a machine learning system and their corresponding impact on the behaviour of the system.The key ideas of model-based machine learning are introduced through a series of case studies involving real-world applications. Case studies play a central role because it is only in the context of applications that it makes sense to discuss modelling assumptions. Each chapter introduces one case study and works through step-by-step to solve it using a model-based approach. The aim is not just to explain machine learning methods, but also showcase how to create, debug, and evolve them to solve a problem.Key Features:· Explores the assumptions being made by machine learning systems and the effect these assumptions have when the system is applied to concrete problems.· Explains machine learning concepts as they arise in real-world case studies.· Shows how to diagnose, understand and address problems with machine learning systems.· Full source code available, allowing models and results to be reproduced and explored.· Includes optional deep-dive sections with more mathematical details on inference algorithms for the interested reader.
R 4,066.00
