تحسين النتائح
ترتيب حسب
من
الى
الصفحة 2
الصفحة 2
Machine Learning and Probabilistic Graphical Models for Decision Support Systems
Presents recent advancements in research, a review of new methods and techniques, and applications in decision support systems (DSS) with Machine Learning and Probabilistic Graphical Models, which are very effective techniques in gaining knowledge from Big Data and in interpreting decisions. It explores Bayesian network learning, Control Chart, Reinforcement Learning for multicriteria DSS, Anomaly Detection in Smart Manufacturing with Federated Learning, DSS in healthcare, DSS for supply chain management, etc. Researchers and practitioners alike will benefit from this book to enhance the understanding of machine learning, Probabilistic Graphical Models, and their uses in DSS in the context of decision making with uncertainty. The real-world case studies in various fields with guidance and recommendations for the practical applications of these studies are introduced in each chapter.
Machine learning and deep learning in medical data analytics and healthcare applications
Introduces and explores a variety of schemes designed to empower, enhance, and represent multi-institutional and multi-disciplinary machine learning (ML) and deep learning (DL) research in healthcare paradigms. Serving as a unique compendium of existing and emerging ML/DL paradigms for the healthcare sector, this book demonstrates the depth, breadth, complexity, and diversity of this multi-disciplinary area. It provides a comprehensive overview of ML/DL algorithms and explores the related use cases in enterprises such as computer-aided medical diagnostics, drug discovery and development, medical imaging, automation, robotic surgery, electronic smart records creation, outbreak prediction, medical image analysis, and radiation treatments.
Machine learning and big data : Concepts, algorithms, tools and applications
Showcase novel use-cases and applications, present empirical research results from user-centered qualitative and quantitative experiments of these new applications, and facilitate a discussion forum to explore the latest trends in big data and machine learning by providing algorithms which can be trained to perform interdisciplinary techniques such as statistics, linear algebra, and optimization and also create automated systems that can sift through large volumes of data at high speed to make predictions or decisions without human intervention
Machine Learning Algorithms Using Python Programming
Presents the key concepts of Machine Learning which includes Python concepts and Interpreter, Foundation of Machine Learning, Data Pre-processing, Supervised Machine Learning, Unsupervised Machine Learning, Reinforcement Learning, Kernel Machine, Design and analysis of Machine Learning experiment and Data visualization. The theoretical concepts along with coding implementation are covered. This book aims to pursue a middle ground between a theoretical textbook and one that focuses on applications. The book concentrates on the important ideas in machine learning.
Machine Learning : Modeling Data Locally and Globally
Machine Learning - Modeling Data Locally and Globally presents a novel and unified theory that tries to seamlessly integrate different algorithms. Specifically, the book distinguishes the inner nature of machine learning algorithms as either "local learning"or "global learning."This theory not only connects previous machine learning methods, or serves as roadmap in various models, but – more importantly – it also motivates a theory that can learn from data both locally and globally. This would help the researchers gain a deeper insight and comprehensive understanding of the techniques in this field. The book reviews current topics,new theories and applications.
List decoding of error-correcting codes : Winning thesis of the 2002 ACM doctoral dissertation competition
Presents some spectacular new results in the area of decoding algorithms for error-correcting codes. Specifically, it shows how the notion of “list-decoding” can be applied to recover from far more errors, for a wide variety of err- correcting codes, than achievable before. A brief bit of background : error-correcting codes are combinatorial str- tures that show how to represent (or “encode”) information so that it is - silient to a moderate number of errors. Speci?cally, an error-correcting code takes a short binary string, called the message, and shows how to transform it into a longer binary string, called the codeword, so that if a small number of bits of the codewordare ?ipped, the resulting string does not look like any other codeword. The maximum number of errorsthat the code is guaranteed to detect, denoted d, is a central parameter in its design. A basic property of such a code is that if the number of errors that occur is known to be smaller than d/2, the message is determined uniquely. This poses a computational problem, called the decoding problem : compute the message from a corrupted codeword, when the number of errors is less than d/2.
Linear Genetic Programming
Linear Genetic Programming examines the evolution of imperative computer programs written as linear sequences of instructions. In contrast to functional expressions or syntax trees used in traditional Genetic Programming (GP), Linear Genetic Programming (LGP) employs a linear program structure as genetic material whose primary characteristics are exploited to achieve acceleration of both execution time and evolutionary progress.
Knowledge Processing with Interval and Soft Computing
In particular, these chapters cover computing techniques for interval linear systems of equations, interval matrix singular-value decomposition, interval function approximation, and decision making with statistical and graph-based data processing. To enable these applications, the book presents a standards-based object-oriented interval computing environment in C++.
Knowledge graphs and big data processing
This book is part of the LAMBDA Project (Learning, Applying, Multiplying Big Data Analytics), funded by the European Union, GA No. 809965. Data Analytics involves applying algorithmic processes to derive insights.
Knowledge and Information Visualization : Searching for Synergies
The basic ideas underlying knowledge visualization and information vi- alization are outlined. In a short preview of the contributions of this volume, the idea behind each approach and its contribution to the goals of the book are outlined. 2 The Basic Concepts of the Book Three basic concepts are the focus of this book: "data", "information", and "kno- edge". There have been numerous attempts to define the terms "data", "information", and "knowledge", among them, the OTEC Homepage "Data, Information, Kno- edge, and Wisdom" (Bellinger, Castro, & Mills, see http://www.syste- thinking.org/dikw/dikw.htm): Data are raw. They are symbols or isolated and non-interpreted facts. Data rep- sent a fact or statement of event without any relation to other data. Data simply exists and has no significance beyond its existence (in and of itself). It can exist in any form, usable or not. It does not have meaning of itself.
JavaScript data structures and algorithms : An Introduction to understanding and implementing core data structure and algorithm fundamentals
Combines clear explanations of data structure and algorithm theory with practical code samples, examples and exercises, all specifically relevant to JavaScript Provides background information on object-oriented programming and native JavaScript concepts to help understand how everything fits together Illustrates how these theoretical computer science concepts ties back to practical applications in software engineering
Iterated Function Systems for Real-Time Image Synthesis
Natural phenomena can be visually described with fractal-geometry methods, where iterative procedures rather than equations are used to model objects. With the development of better modelling algorithms, the efficiency of rendering, the realism of computer-generated scenes and the interactivity of visual stimuli are reaching astonishing levels. Iterated Function Systems for Real-Time Image Synthesis gives an explanation of iterated function systems and how to use them in generation of complex objects.
Computation Engineering : Applied Automata Theory and Logic
This book covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field. In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented.
Comprehensive mathematics for computer scientists 2 : Calculus and ODEs, splines, probability, fourier and wavelet theory, fractals and neural networks, categories and lambda calculus
This second volume of a comprehensive tour through mathematical core subjects for computer scientists completes the ?rst volume in two - gards: Part III ?rst adds topology, di?erential, and integral calculus to the t- ics of sets, graphs, algebra, formal logic, machines, and linear geometry, of volume 1. With this spectrum of fundamentals in mathematical e- cation, young professionals should be able to successfully attack more involved subjects, which may be relevant to the computational sciences. In a second regard, the end of part III and part IV add a selection of more advanced topics. In view of the overwhelming variety of mathematical approaches in the computational sciences, any selection, even the most empirical, requires a methodological justi?cation. Our primary criterion has been the search for harmonization and optimization of thematic - versity and logical coherence. This is why we have, for instance, bundled such seemingly distant subjects as recursive constructions, ordinary d- ferential equations, and fractals under the unifying perspective of c- traction theory.
Complexity Theory and Cryptology : An Introduction to Cryptocomplexity
Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas. This textbook is suitable for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.
Complexity Theory : Exploring the Limits of Efficient Algorithms
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
Complexity of Constraints : An Overview of Current Research Themes
This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006.
Competitive Programming in Python : 128 Algorithms to Develop your Coding Skills
Learn all the algorithmic techniques and programming skills you need from two experienced coaches, problem setters, and jurors for coding competitions. The authors highlight the versatility of each algorithm by considering a variety of problems and show how to implement algorithms in simple and efficient code. What to expect: * Master 128 algorithms in Python. * Discover the right way to tackle a problem and quickly implement a solution of low complexity.
Classification and Modeling with Linguistic Information Granules : Advanced Approaches to Linguistic Data Mining
Many approaches have already been proposed for classification and modeling in the literature. These approaches are usually based on mathematical mod els. Computer systems can easily handle mathematical models even when they are complicated and nonlinear (e.g., neural networks). On the other hand, it is not always easy for human users to intuitively understand mathe matical models even when they are simple and linear. This is because human information processing is based mainly on linguistic knowledge while com puter systems are designed to handle symbolic and numerical information. A large part of our daily communication is based on words. We learn from various media such as books, newspapers, magazines, TV, and the Inter net through words. We also communicate with others through words. While words play a central role in human information processing, linguistic models are not often used in the fields of classification and modeling. If there is no goal other than the maximization of accuracy in classification and modeling, mathematical models may always be preferred to linguistic models. On the other hand, linguistic models may be chosen if emphasis is placed on interpretability.
Boundary Representation Modelling Techniques
Boundary representation is the principle solid modelling method used in modern CAD/CAM systems. There have been a long series of developments on which currently available systems are based, full details of which are only partially known. Ian Stroud’s thorough coverage of these developments puts this technology in perspective. Ian Stroud started working with boundary representation solid modelling in 1977. Since then he has researched and is researching a wide variety of topics in and around this field. The information in the book comes from the results of this research.
