Search results for "optimization algorithms for machine learning"
Items we need to order for you
Geometric Algorithms and Combinatorial Optimization
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather, it seems that many of the new results build on the models, algorithms, and theorems presented here. For instance, the celebrated Dyer-Frieze-Kannan algorithm for approximating the volume of a convex body is based on the oracle model of convex bodies and uses the ellipsoid method as a preprocessing technique. The polynomial time equivalence of optimization, separation, and membership has become a commonly employed tool in the study of the complexity of combinatorial optimization problems and in the newly developing field of computational convexity. Implementations of the basis reduction algorithm can be found in various computer algebra software systems. On the other hand, several of the open problems discussed in the first edition are still unsolved. For example, there are still no combinatorial polynomial time algorithms known for minimizing a submodular function or finding a maximum clique in a perfect graph. Moreover, despite the success of the interior point methods for the solution of explicitly given linear programs there is still no method known that solves implicitly given linear programs, such as those described in this book, and that is both practically and theoretically efficient. In particular, it is not known how to adapt interior point methods to such linear programs.
R 3,990.59
Advances in Metaheuristic Algorithms for Optimal Design of Structures
This book presents efficient metaheuristic algorithms for optimal design of structures. Many of these algorithms are developed by the author and his graduate students, consisting of Particle Swarm Optimization, Charged System Search, Magnetic Charged System Search, Field of Forces Optimization, Democratic Particle Swarm Optimization, Dolphin Echolocation Optimization, Colliding Bodies Optimization, Ray Optimization. These are presented together with algorithms which are developed by other authors and have been successfully applied to various optimization problems. These consist of Partical Swarm Optimization, Big Band Big Crunch algorithm, Cuckoo Search Optimization, Imperialist Competitive Algorithm and Chaos Embedded Metaheuristic Algorithm. Finally a multi-objective Optimization is presented to Solve large scale structural problems based on the Charged System Search algorithm, In the second edition seven new chapters are added consisting of Enhance colliding bodies optimization, Global sensitivity analysis, Tug of War Optimization, Water evaporation optimization, Vibrating System Optimization and Cyclical Parthenogenesis Optimization algorithm. In the third edition, five new chapters are included consisting of the recently developed algorithms. These are Shuffled Shepherd Optimization Algorithm, Set Theoretical Shuffled Shepherd Optimization Algorithm, Set Theoretical Teaching-Learning-Based Optimization Algorithm, Thermal Exchange Metaheuristic Optimization Algorithm, and Water Strider Optimization Algorithm and Its Enhancement. The concepts and algorithm presented in this book are not only applicable to optimization of skeletal structure, finite element models, but can equally be utilized for optimal design of other systems such as hydraulic and electrical networks.
R 9,630.24
Machine Learning for Environmental Monitoring in Wireless Sensor Networks
Today, data fuels everything we do in a highly connected world. However, traditional environmental monitoring methods often fail to provide timely and accurate data for effective decision-making in today's rapidly changing ecosystems. The reliance on manual data collection and outdated technologies results in gaps in data coverage, making it challenging to detect and respond to environmental changes in real time. Additionally, integration between monitoring systems and advanced data analysis tools is necessary to derive actionable insights from collected data. As a result, environmental managers and policymakers face significant challenges in effectively monitoring, managing, and conserving natural resources in a rapidly evolving environment. Machine Learning for Environmental Monitoring in Wireless Sensor Networks offers a comprehensive solution to the limitations of traditional environmental monitoring methods. By harnessing the power of Wireless Sensor Networks (WSNs) and advanced machine learning algorithms, this book presents a novel approach to ecological monitoring that enables real-time, high-resolution data collection and analysis. By integrating WSNs and machine learning, environmental stakeholders can gain deeper insights into complex ecological processes, allowing for more informed decision-making and proactive management of natural resources. Key features of the book include an in-depth exploration of the principles, methodologies, and applications of WSNs and machine learning in environmental monitoring, real-world case studies and projects illustrating successful implementations, and a discussion on energy-efficient strategies for optimizing the sustainability of WSN deployments. Emphasis is placed on interdisciplinary collaborations among environmental scientists, engineers, data scientists, policymakers, and other stakeholders to foster innovative solutions for sustainable ecological monitoring. This book, tailored for researchers, practitioners, policymakers, and environmental enthusiasts, is an invaluable resource for leveraging cutting-edge technologies to address environmental monitoring and conservation challenges.
R 10,644.01
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
Advances in Bio-inspired Computing for Combinatorial Optimization Problems
"Advances in Bio-inspired Combinatorial Optimization Problems" illustrates several recent bio-inspired efficient algorithms for solving NP-hard problems.Theoretical bio-inspired concepts and models, in particular for agents, ants and virtual robots are described. Large-scale optimization problems, for example: the Generalized Traveling Salesman Problem and the Railway Traveling Salesman Problem, are solved and their results are discussed.Some of the main concepts and models described in this book are: inner rule to guide ant search - a recent model in ant optimization, heterogeneous sensitive ants; virtual sensitive robots; ant-based techniques for static and dynamic routing problems; stigmergic collaborative agents and learning sensitive agents.This monograph is useful for researchers, students and all people interested in the recent natural computing frameworks. The reader is presumed to have knowledge of combinatorial optimization, graph theory, algorithms and programming. The book should furthermore allow readers to acquire ideas, concepts and models to use and develop new software for solving complex real-life problems.
R 4,030.00
Derivative-free Two Level Random Search Method for Unconstrained Optimization
The book is intended for graduate students and researchers in mathematics, computer science, and operational research. The book presents a new derivative-free optimization method/algorithm based on randomly generated trial points in specified domains and where the best ones are selected at each iteration by using a number of rules. This method is different from many other well established methods presented in the literature and proves to be competitive for solving many unconstrained optimization problems with different structures and complexities, with a relative large number of variables. Intensive numerical experiments with 140 unconstrained optimization problems, with up to 500 variables, have shown that this approach is efficient and robust.Structured into 4 chapters, Chapter 1 is introductory. Chapter 2 is dedicated to presenting a two level derivative-free random search method for unconstrained optimization. It is assumed that the minimizing function is continuous, lower bounded and its minimum value is known. Chapter 3 proves the convergence of the algorithm. In Chapter 4, the numerical performances of the algorithm are shown for solving 140 unconstrained optimization problems, out of which 16 are real applications. This shows that the optimization process has two phases: the reduction phase and the stalling one. Finally, the performances of the algorithm for solving a number of 30 large-scale unconstrained optimization problems up to 500 variables are presented. These numerical results show that this approach based on the two level random search method for unconstrained optimization is able to solve a large diversity of problems with different structures and complexities.There are a number of open problems which refer to the following aspects: the selection of the number of trial or the number of the local trial points, the selection of the bounds of the domains where the trial points and the local trial points are randomly generated and a criterion for initiating the line search.
R 2,381.00
Genetic Algorithms And Robotics: A Heuristic Strategy For Optimization
Classical optimization methodologies fall short in very large and complex domains. In this book is suggested a different approach to optimization, an approach which is based on the 'blind' and heuristic mechanisms of evolution and population genetics. The genetic approach to optimization introduces a new philosophy to optimization in general, but particularly to engineering. By introducing the ‘genetic’ approach to robot trajectory generation, much can be learned about the adaptive mechanisms of evolution and how these mechanisms can solve real world problems. It is suggested further that optimization at large may benefit greatly from the adaptive optimization exhibited by natural systems when attempting to solve complex optimization problems, and that the determinism of classical optimization models may sometimes be an obstacle in nonlinear systems.This book is unique in that it reports in detail on an application of genetic algorithms to a real world problem, and explains the considerations taken during the development work. Futhermore, it addresses robotics in two new aspects: the optimization of the trajectory specification which has so far been done by human operators and has not received much attention for both automation and optimization, and the introduction of a heuristic strategy to a field predominated by deterministic strategies.
R 1,619.60
Entropy Guided Transformation Learning: Algorithms and Applications
Entropy Guided Transformation Learning: Algorithms and Applications (ETL) presents a machine learning algorithm for classification tasks. ETL generalizes Transformation Based Learning (TBL) by solving the TBL bottleneck: the construction of good template sets. ETL automatically generates templates using Decision Tree decomposition.The authors describe ETL Committee, an ensemble method that uses ETL as the base learner. Experimental results show that ETL Committee improves the effectiveness of ETL classifiers. The application of ETL is presented to four Natural Language Processing (NLP) tasks: part-of-speech tagging, phrase chunking, named entity recognition and semantic role labeling. Extensive experimental results demonstrate that ETL is an effective way to learn accurate transformation rules, and shows better results than TBL with handcrafted templates for the four tasks. By avoiding the use of handcrafted templates, ETL enables the use of transformation rules to a greater range of tasks.Suitable for both advanced undergraduate and graduate courses, Entropy Guided Transformation Learning: Algorithms and Applications provides a comprehensive introduction to ETL and its NLP applications.
R 1,514.94
Practical Machine Learning with Rust
Explore machine learning in Rust and learn about the intricacies of creating machine learning applications. This book begins by covering the important concepts of machine learning such as supervised, unsupervised, and reinforcement learning, and the basics of Rust. Further, you’ll dive into the more specific fields of machine learning, such as computer vision and natural language processing, and look at the Rust libraries that help create applications for those domains. We will also look at how to deploy these applications either on site or over the cloud.After reading Practical Machine Learning with Rust, you will have a solid understanding of creating high computation libraries using Rust. Armed with the knowledge of this amazing language, you will be able to create applications that are more performant, memory safe, and less resource heavy. What You Will LearnWrite machine learning algorithms in RustUse Rust libraries for different tasks in machine learningCreate concise Rust packages for your machine learning applicationsImplement NLP and computer vision in RustDeploy your code in the cloud and on bare metal servers Who This Book Is For Machine learning engineers and software engineers interested in building machine learning applications in Rust.
R 1,298.29
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
This volume contains the papers presented at the 12th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2009) and the 13th International Workshop on Randomization and Computation (RANDOM 2009), which took place concurrently at the HP - ditorium in UC Berkeley, USA, during August 21-23, 2009. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 12th in the series after Aalborg (1998), Berkeley (1999), Saarbru ..cken (2000), Ber- ley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 13th workshop in the series following Bologna (1997), Barcelona (1998),Berkeley(1999),Geneva(2000),Berkeley(2001),Harvard(2002),Prin- ton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), Princeton (2007), and Boston (2008).Topics of interest for APPROX and RANDOM are: design and analysis of approximation algorithms, hardness of approximation, small space algorithms, sub-linear time algorithms, streaming algorithms, embeddings and metric space methods,mathematicalprogrammingmethods,combinatorialproblemsingraphs andnetworks,gametheory,markets,andeconomicapplications,geometricpr- lems, packing, covering, scheduling, approximate learning, design and analysis of online algorithms, randomized complexity theory, pseudorandomness and - randomization,randomcombinatorialstructures, randomwalks/Markovchains, expander graphs and randomness extractors, probabilistic proof systems, err- correctingcodes,average-caseanalysis,propertytesting,computationallearning theory, and other applications of approximation and randomness. The volume contains 25 contributed papers, selected by the APPROX Program Committee out of 56 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 57 submissions.
R 3,111.52
Grokking Artificial Intelligence Algorithms
AI is primed to revolutionize the way we build applications, offering exciting new ways to solve problems, uncover insights, innovate new products, and provide better user experiences. Successful AI is based on a set of core algorithms that form a base of knowledge shared by all data scientists. Grokking Artificial Intelligence Algorithms is a fully-illustrated and interactive tutorial guide to the different approaches and algorithms that underpin AI. Written in simple language and with lots of visual references and hands-on examples, readers learn the concepts, terminology, and theory they need to effectively incorporate AI algorithms into their applications. Grokking Artificial Intelligence Algorithms uses simple language, jargon-busting explanations, and hand-drawn diagrams to open up complex algorithms. Don’t worry if you aren’t a calculus wunderkind; you’ll need only the algebra you picked up in math class. • Use cases for different AI algorithms • How to encode problems and solutions using data structures • Intelligent search for game playing • Ant colony algorithms for path finding • Evolutionary algorithms for optimization problems For software developers with high school-level algebra and calculus skills.
R 1,424.00
Iterative Methods in Combinatorial Optimization
With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
R 2,438.48
Large Scale Linear and Integer Optimization: A Unified Approach
This is a textbook about linear and integer linear optimization. There is a growing need in industries such as airline, trucking, and financial engineering to solve very large linear and integer linear optimization problems. Building these models requires uniquely trained individuals. Not only must they have a thorough understanding of the theory behind mathematical programming, they must have substantial knowledge of how to solve very large models in today's computing environment. The major goal of the book is to develop the theory of linear and integer linear optimization in a unified manner and then demonstrate how to use this theory in a modern computing environment to solve very large real world problems. After presenting introductory material in Part I, Part II of this book is de voted to the theory of linear and integer linear optimization. This theory is developed using two simple, but unifying ideas: projection and inverse projec tion. Through projection we take a system of linear inequalities and replace some of the variables with additional linear inequalities. Inverse projection, the dual of this process, involves replacing linear inequalities with additional variables. Fundamental results such as weak and strong duality, theorems of the alternative, complementary slackness, sensitivity analysis, finite basis the orems, etc. are all explained using projection or inverse projection. Indeed, a unique feature of this book is that these fundamental results are developed and explained before the simplex and interior point algorithms are presented.
R 14,966.52
Optimization in Computational Chemistry and Molecular Biology
Optimization in Computational Chemistry and Molecular Biology: Local and Global Approaches covers recent developments in optimization techniques for addressing several computational chemistry and biology problems. A tantalizing problem that cuts across the fields of computational chemistry, biology, medicine, engineering and applied mathematics is how proteins fold. Global and local optimization provide a systematic framework of conformational searches for the prediction of three-dimensional protein structures that represent the global minimum free energy, as well as low-energy biomolecular conformations. Each contribution in the book is essentially expository in nature, but of scholarly treatment. The topics covered include advances in local and global optimization approaches for molecular dynamics and modeling, distance geometry, protein folding, molecular structure refinement, protein and drug design, and molecular and peptide docking. Audience: The book is addressed not only to researchers in mathematical programming, but to all scientists in various disciplines who use optimization methods in solving problems in computational chemistry and biology.
R 4,662.54
Reinforcement Learning Algorithms: Analysis and Applications
This book reviews research developments in diverse areas of reinforcement learning such as model-free actor-critic methods, model-based learning and control, information geometry of policy searches, reward design, and exploration in biology and the behavioral sciences. Special emphasis is placed on advanced ideas, algorithms, methods, and applications. The contributed papers gathered here grew out of a lecture course on reinforcement learning held by Prof. Jan Peters in the winter semester 2018/2019 at Technische Universität Darmstadt. The book is intended for reinforcement learning students and researchers with a firm grasp of linear algebra, statistics, and optimization. Nevertheless, all key concepts are introduced in each chapter, making the content self-contained and accessible to a broader audience.
R 5,074.45
Global Optimization with Non-Convex Constraints
Everything should be made as simple as possible, but not simpler. (Albert Einstein, Readers Digest, 1977) The modern practice of creating technical systems and technological processes of high effi.ciency besides the employment of new principles, new materials, new physical effects and other new solutions ( which is very traditional and plays the key role in the selection of the general structure of the object to be designed) also includes the choice of the best combination for the set of parameters (geometrical sizes, electrical and strength characteristics, etc.) concretizing this general structure, because the Variation of these parameters ( with the structure or linkage being already set defined) can essentially affect the objective performance indexes. The mathematical tools for choosing these best combinations are exactly what is this book about. With the advent of computers and the computer-aided design the pro bations of the selected variants are usually performed not for the real examples ( this may require some very expensive building of sample op tions and of the special installations to test them ), but by the analysis of the corresponding mathematical models. The sophistication of the mathematical models for the objects to be designed, which is the natu ral consequence of the raising complexity of these objects, greatly com plicates the objective performance analysis. Today, the main (and very often the only) available instrument for such an analysis is computer aided simulation of an object's behavior, based on numerical experiments with its mathematical model.
R 8,225.23
Advances in Metaheuristics for Hard Optimization
Many advances have recently been made in metaheuristic methods, from theory to applications. The editors, both leading experts in this field, have assembled a team of researchers to contribute 21 chapters organized into parts on simulated annealing, tabu search, ant colony algorithms, general purpose studies of evolutionary algorithms, applications of evolutionary algorithms, and metaheuristics.
R 4,685.74
Machine Learning for Environmental Monitoring in Wireless Sensor Networks
Today, data fuels everything we do in a highly connected world. However, traditional environmental monitoring methods often fail to provide timely and accurate data for effective decision-making in today's rapidly changing ecosystems. The reliance on manual data collection and outdated technologies results in gaps in data coverage, making it challenging to detect and respond to environmental changes in real time. Additionally, integration between monitoring systems and advanced data analysis tools is necessary to derive actionable insights from collected data. As a result, environmental managers and policymakers face significant challenges in effectively monitoring, managing, and conserving natural resources in a rapidly evolving environment. Machine Learning for Environmental Monitoring in Wireless Sensor Networks offers a comprehensive solution to the limitations of traditional environmental monitoring methods. By harnessing the power of Wireless Sensor Networks (WSNs) and advanced machine learning algorithms, this book presents a novel approach to ecological monitoring that enables real-time, high-resolution data collection and analysis. By integrating WSNs and machine learning, environmental stakeholders can gain deeper insights into complex ecological processes, allowing for more informed decision-making and proactive management of natural resources. Key features of the book include an in-depth exploration of the principles, methodologies, and applications of WSNs and machine learning in environmental monitoring, real-world case studies and projects illustrating successful implementations, and a discussion on energy-efficient strategies for optimizing the sustainability of WSN deployments. Emphasis is placed on interdisciplinary collaborations among environmental scientists, engineers, data scientists, policymakers, and other stakeholders to foster innovative solutions for sustainable ecological monitoring. This book, tailored for researchers, practitioners, policymakers, and environmental enthusiasts, is an invaluable resource for leveraging cutting-edge technologies to address environmental monitoring and conservation challenges.
R 14,090.98
Fundamentals of Optimization Techniques with Algorithms
Optimization is a key concept in mathematics, computer science, and operations research, and is essential to the modeling of any system, playing an integral role in computer-aided design. Fundamentals of Optimization Techniques with Algorithms presents a complete package of various traditional and advanced optimization techniques along with a variety of example problems, algorithms and MATLAB© code optimization techniques, for linear and nonlinear single variable and multivariable models, as well as multi-objective and advanced optimization techniques. It presents both theoretical and numerical perspectives in a clear and approachable way. In order to help the reader apply optimization techniques in practice, the book details program codes and computer-aided designs in relation to real-world problems. Ten chapters cover, an introduction to optimization; linear programming; single variable nonlinear optimization; multivariable unconstrained nonlinear optimization; multivariable constrained nonlinear optimization; geometric programming; dynamic programming; integer programming; multi-objective optimization; and nature-inspired optimization. This book provides accessible coverage of optimization techniques, and helps the reader to apply them in practice.
R 4,414.00
Optimization Theory and Methods
Optimization Theory and Methods can be used as a textbook for an optimization course for graduates and senior undergraduates. It is the result of the author's teaching and research over the past decade. It describes optimization theory and several powerful methods. For most methods, the book discusses an idea’s motivation, studies the derivation, establishes the global and local convergence, describes algorithmic steps, and discusses the numerical performance.
R 4,180.16
Computing Tools for Modeling, Optimization and Simulation
Computing Tools for Modeling, Optimization and Simulation reflects the need for preserving the marriage between operations research and computing in order to create more efficient and powerful software tools in the years ahead. The 17 papers included in this volume were carefully selected to cover a wide range of topics related to the interface between operations research and computer science. The volume includes the now perennial applications of rnetaheuristics (such as genetic algorithms, scatter search, and tabu search) as well as research on global optimization, knowledge management, software rnaintainability and object-oriented modeling. These topics reflect the complexity and variety of the problems that current and future software tools must be capable of tackling. The OR/CS interface is frequently at the core of successful applications and the development of new methodologies, making the research in this book a relevant reference in the future. The editors' goal for this book has been to increase the interest in the interface of computer science and operations research. Both researchers and practitioners will benefit from this book. The tutorial papers may spark the interest of practitioners for developing and applying new techniques to complex problems. In addition, the book includes papers that explore new angles of well-established methods for problems in the area of nonlinear optimization and mixed integer programming, which seasoned researchers in these fields may find fascinating.
R 6,006.00
Introduction to Global Optimization
Global optimization concerns the computation and characterization of global optima of nonlinear functions. Such problems are widespread in the mathematical modelling of real systems in a very wide range of applications and the last 30 years have seen the development of many new theoretical, algorithmic and computational contributions which have helped to solve globally multiextreme problems in important practical applications. Most of the existing books on optimization focus on the problem of computing locally optimal solutions. Introduction to Global Optimization, however, is a comprehensive textbook on constrained global optimization that covers the fundamentals of the subject, presenting much new material, including algorithms, applications and complexity results for quadratic programming, concave minimization, DC and Lipschitz problems, and nonlinear network flow. Each chapter contains illustrative examples and ends with carefully selected exercises, designed to help students grasp the material and enhance their knowledge of the methods involved. Audience: Students of mathematical programming, and all scientists, from whatever discipline, who need global optimization methods in such diverse areas as economic modelling, fixed charges, finance, networks and transportation, databases, chip design, image processing, nuclear and mechanical design, chemical engineering design and control, molecular biology, and environmental engineering.
R 6,007.01
Linear Optimization and Extensions
From the reviews: "Do you know M.Padberg's Linear Optimization and Extensions? […] Now here is the continuation of it, discussing the solutions of all its exercises and with detailed analysis of the applications mentioned. Tell your students about it. […] For those who strive for good exercises and case studies for LP this is an excellent volume." Acta Scientiarum Mathematicarum
R 3,074.20
R 466.00
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 3,622.37
R 501.00
Multilevel Optimization: Algorithms and Applications
Researchers working with nonlinear programming often claim "the word is non linear" indicating that real applications require nonlinear modeling. The same is true for other areas such as multi-objective programming (there are always several goals in a real application), stochastic programming (all data is uncer tain and therefore stochastic models should be used), and so forth. In this spirit we claim: The word is multilevel. In many decision processes there is a hierarchy of decision makers, and decisions are made at different levels in this hierarchy. One way to handle such hierar chies is to focus on one level and include other levels' behaviors as assumptions. Multilevel programming is the research area that focuses on the whole hierar chy structure. In terms of modeling, the constraint domain associated with a multilevel programming problem is implicitly determined by a series of opti mization problems which must be solved in a predetermined sequence. If only two levels are considered, we have one leader (associated with the upper level) and one follower (associated with the lower level).
R 6,018.31
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
This volume contains the papers presented at the 11th International Wo- shop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008) and the 12th International Workshop on Randomization and Computation (RANDOM 2008), which took place concurrently at the MIT (M- sachusetts Institute of Technology) in Boston, USA, during August 25–27, 2008. APPROX focuses on algorithmic and complexity issues surrounding the development of e?cient approximate solutions to computationally di?cult problems, and was the 11th in the series after Aalborg (1998), Berkeley (1999), Saarbru ¨cken (2000), Berkeley (2001), Rome (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). RANDOM is concerned with applications of randomness to computational and combinatorial problems, and was the 12th workshop in the series following Bologna (1997), Barcelona (1998), Berkeley (1999), Geneva (2000), Berkeley (2001), Harvard (2002), Princeton (2003), Cambridge (2004), Berkeley (2005), Barcelona (2006), and Princeton (2007). Topics of interest for APPROX and RANDOM are: design and analysis of - proximation algorithms, hardness of approximation, small space, sub-linear time, streaming, algorithms, embeddings and metric space methods, mathematical programming methods, combinatorial problems in graphs and networks, game t- ory, markets, economic applications, geometric problems, packing, covering, scheduling, approximate learning, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and - beddings, error-correcting codes, average-case analysis, property testing, com- tational learning theory, and other applications of approximation and randomness.
R 4,140.89
Algorithms in Advanced Artificial Intelligence
Algorithms in Advanced Artificial Intelligence is a collection of papers on emerging issues, challenges, and new methods in Artificial Intelligence, Machine Learning, Deep Learning, Cloud Computing, Federated Learning, Internet of Things, and Blockchain technology. It addresses the growing attention to advanced technologies due to their ability to provide “paranormal solutions” to problems associated with classical Artificial Intelligence frameworks. AI is used in various subfields, including learning, perception, and financial decisions. It uses four strategies: Thinking Humanly, Thinking Rationally, Acting Humanly, and Acting Rationally. The authors address various issues in ICT, including Artificial Intelligence, Machine Learning, Deep Learning, Data Science, Big Data Analytics, Vision, Internet of Things, Security and Privacy aspects in AI, and Blockchain and Digital Twin Integrated Applications in AI.
R 3,151.55
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
This volume is a compilation of the research program of the 10th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, CPAIOR 2013, held at Yorktown Heights, NY, USA, in May 2013. This volume contains 20 full papers and 11 short papers that were carefully reviewed and selected from 71 submissions. The papers focus on new techniques or applications in the intersection of constraint programming (CP), artificial intelligence (AI) and operations research (OR).
R 2,192.26
Hands-On Machine Learning with R
Hands-on Machine Learning with R provides a practical and applied approach to learning and developing intuition into today’s most popular machine learning methods. This book serves as a practitioner’s guide to the machine learning process and is meant to help the reader learn to apply the machine learning stack within R, which includes using various R packages such as glmnet, h2o, ranger, xgboost, keras, and others to effectively model and gain insight from their data. The book favors a hands-on approach, providing an intuitive understanding of machine learning concepts through concrete examples and just a little bit of theory. Throughout this book, the reader will be exposed to the entire machine learning process including feature engineering, resampling, hyperparameter tuning, model evaluation, and interpretation. The reader will be exposed to powerful algorithms such as regularized regression, random forests, gradient boosting machines, deep learning, generalized low rank models, and more! By favoring a hands-on approach and using real word data, the reader will gain an intuitive understanding of the architectures and engines that drive these algorithms and packages, understand when and how to tune the various hyperparameters, and be able to interpret model results. By the end of this book, the reader should have a firm grasp of R’s machine learning stack and be able to implement a systematic approach for producing high quality modeling results.Features:· Offers a practical and applied introduction to the most popular machine learning methods.· Topics covered include feature engineering, resampling, deep learning and more.· Uses a hands-on approach and real world data.
R 5,165.00
Advanced Optimization and Decision-Making Techniques in Textile Manufacturing
Optimization and decision making are integral parts of any manufacturing process and management system. The objective of this book is to demonstrate the confluence of theory and applications of various types of multi-criteria decision making and optimization techniques with reference to textile manufacturing and management. Divided into twelve chapters, it discusses various multi-criteria decision-making methods such as AHP, TOPSIS, ELECTRE, and optimization techniques like linear programming, fuzzy linear programming, quadratic programming, in textile domain. Multi-objective optimization problems have been dealt with two approaches, namely desirability function and evolutionary algorithm.Key Features Exclusive title covering textiles and soft computing fields including optimization and decision making Discusses concepts of traditional and non-traditional optimization methods with textile examples Explores pertinent single-objective and multi-objective optimizations Provides MATLAB coding in the Appendix to solve various types of multi-criteria decision making and optimization problems Includes examples and case studies related to textile engineering and management
R 3,159.53
Soccer Analytics with Machine Learning
Struggling to grasp machine learning concepts or unsure how to apply them in the real world? This book aims to change that by using the world's most popular game—soccer—to illuminate key concepts in predictive modeling and data science. Whether you're a complete beginner or you're interested in entering the burgeoning field of sports analytics, you'll develop a solid foundation in machine learning through engaging examples that bridge academic principles with practical applications.Written by experts in both machine learning and sports analytics, this practical Python-focused guide introduces fundamental data science techniques using real soccer data. Ideal for students, analysts, and soccer fans alike, it offers instructions on models and techniques such as logistic regression, random forests, deep learning, simulations, and feature engineering. But instead of memorizing algorithms, you'll learn by building predictive models to analyze match outcomes, test betting strategies, run simulated game scenarios, and more.Understand machine learning concepts by working with real sports dataDevelop, refine, and evaluate machine learning models, using Python for data analysisCarry out detailed analyses and research on soccer game predictions and betting strategies to surface valuable insightsApply the skills you learn to predictive modeling scenarios in other industries
R 1,368.00
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
Machine Learning: Theoretical Foundations and Practical Applications
This edited book is a collection of chapters invited and presented by experts at 10th industry symposium held during 9–12 January 2020 in conjunction with 16th edition of ICDCIT. The book covers topics, like machine learning and its applications, statistical learning, neural network learning, knowledge acquisition and learning, knowledge intensive learning, machine learning and information retrieval, machine learning for web navigation and mining, learning through mobile data mining, text and multimedia mining through machine learning, distributed and parallel learning algorithms and applications, feature extraction and classification, theories and models for plausible reasoning, computational learning theory, cognitive modelling and hybrid learning algorithms.
R 7,319.03
Recent Advances in Computational Optimization
Optimization is part of our everyday life. We try to organize our work in a better way and optimization occurs in minimizing time and cost or the maximization of the profit, quality and efficiency.Also many real world problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks.This volume is a comprehensive collection of extended contributions from the Workshop on Computational Optimization.This book presents recent advances in computational optimization. The volume includes important real world problems like parameter settings for con- trolling processes in bioreactor, robot skin wiring, strip packing, project scheduling, tuning of PID controller and so on. Some of them can be solved by applying traditional numerical methods, but others need a huge amount of computational resources. For them it is shown that is appropriate to develop algorithms based on metaheuristic methods like evolutionary computation, ant colony optimization, constrain programming etc.
R 3,021.03
Reinforcement Learning Algorithms with Python
Develop self-learning algorithms and agents using TensorFlow and other Python tools, frameworks, and librariesKey FeaturesLearn, develop, and deploy advanced reinforcement learning algorithms to solve a variety of tasksUnderstand and develop model-free and model-based algorithms for building self-learning agentsWork with advanced Reinforcement Learning concepts and algorithms such as imitation learning and evolution strategiesBook DescriptionReinforcement Learning (RL) is a popular and promising branch of AI that involves making smarter models and agents that can automatically determine ideal behavior based on changing requirements. This book will help you master RL algorithms and understand their implementation as you build self-learning agents.Starting with an introduction to the tools, libraries, and setup needed to work in the RL environment, this book covers the building blocks of RL and delves into value-based methods, such as the application of Q-learning and SARSA algorithms. You'll learn how to use a combination of Q-learning and neural networks to solve complex problems. Furthermore, you'll study the policy gradient methods, TRPO, and PPO, to improve performance and stability, before moving on to the DDPG and TD3 deterministic algorithms. This book also covers how imitation learning techniques work and how Dagger can teach an agent to drive. You'll discover evolutionary strategies and black-box optimization techniques, and see how they can improve RL algorithms. Finally, you'll get to grips with exploration approaches, such as UCB and UCB1, and develop a meta-algorithm called ESBAS.By the end of the book, you'll have worked with key RL algorithms to overcome challenges in real-world applications, and be part of the RL research community.What you will learnDevelop an agent to play CartPole using the OpenAI Gym interfaceDiscover the model-based reinforcement learning paradigmSolve the Frozen Lake problem with dynamic programmingExplore Q-learning and SARSA with a view to playing a taxi gameApply Deep Q-Networks (DQNs) to Atari games using GymStudy policy gradient algorithms, including Actor-Critic and REINFORCEUnderstand and apply PPO and TRPO in continuous locomotion environmentsGet to grips with evolution strategies for solving the lunar lander problemWho this book is forIf you are an AI researcher, deep learning user, or anyone who wants to learn reinforcement learning from scratch, this book is for you. You’ll also find this reinforcement learning book useful if you want to learn about the advancements in the field. Working knowledge of Python is necessary.
R 1,335.00
Monte Carlo Methods in Fuzzy Optimization
Monte Carlo Methods in Fuzzy Optimization is a clear and didactic book about Monte Carlo methods using random fuzzy numbers to obtain approximate solutions to fuzzy optimization problems. The book includes various solved problems such as fuzzy linear programming, fuzzy regression, fuzzy inventory control, fuzzy game theory, and fuzzy queuing theory. The book will appeal to engineers, researchers, and students in Fuzziness and applied mathematics.
R 3,033.04
Optimization Techniques in Computer Vision
This book presents practical optimization techniques used in image processing and computer vision problems. Ill-posed problems are introduced and used as examples to show how each type of problem is related to typical image processing and computer vision problems. Unconstrained optimization gives the best solution based on numerical minimization of a single, scalar-valued objective function or cost function. Unconstrained optimization problems have been intensively studied, and many algorithms and tools have been developed to solve them. Most practical optimization problems, however, arise with a set of constraints. Typical examples of constraints include: (i) pre-specified pixel intensity range, (ii) smoothness or correlation with neighboring information, (iii) existence on a certain contour of lines or curves, and (iv) given statistical or spectral characteristics of the solution. Regularized optimization is a special method used to solve a class of constrained optimization problems. The term regularization refers to the transformation of an objective function with constraints into a different objective function, automatically reflecting constraints in the unconstrained minimization process. Because of its simplicity and efficiency, regularized optimization has many application areas, such as image restoration, image reconstruction, optical flow estimation, etc.Optimization plays a major role in a wide variety of theories for image processing and computer vision. Various optimization techniques are used at different levels for these problems, and this volume summarizes and explains these techniques as applied to image processing and computer vision.
R 4,508.35
Optimization and Control with Applications
A collection of 28 refereed papers grouped according to four broad topics: duality and optimality conditions, optimization algorithms, optimal control, and variational inequality and equilibrium problems. Suitable for researchers, practitioners and postgrads.
R 6,050.37
R 312.00
Iterative Methods in Combinatorial Optimization
With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
R 4,328.50
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
Lectures on Convex Optimization
This book provides a comprehensive, modern introduction to convex optimization, a field that is becoming increasingly important in applied mathematics, economics and finance, engineering, and computer science, notably in data science and machine learning.Written by a leading expert in the field, this book includes recent advances in the algorithmic theory of convex optimization, naturally complementing the existing literature. It contains a unified and rigorous presentation of the acceleration techniques for minimization schemes of first- and second-order. It provides readers with a full treatment of the smoothing technique, which has tremendously extended the abilities of gradient-type methods. Several powerful approaches in structural optimization, including optimization in relative scale and polynomial-time interior-point methods, are also discussed in detail.Researchers in theoretical optimization as well as professionals working on optimization problems will find this book very useful. It presents many successful examples of how to develop very fast specialized minimization algorithms. Based on the author’s lectures, it can naturally serve as the basis for introductory and advanced courses in convex optimization for students in engineering, economics, computer science and mathematics.
R 1,875.71
Introduction to Stochastic Search and Optimization
* Unique in its survey of the range of topics. * Contains a strong, interdisciplinary format that will appeal to both students and researchers. * Features exercises and web links to software and data sets.
R 6,707.00
