Search results for "Machine Learning for Pattern Recognition"
Items we need to order for you

R 333.41

Machine Learning and Soft Computing
This two part-volume CCIS constitutes the refereed proceedings of 9th International Conference, ICMLSC 2025, in Tokyo, Japan in January 24–26, 2025. The 39 full papers and 13 short papers included in this book were carefully reviewed and selected from 121 submissions. They follow the topical sections as below:Part I : Multimodal Data Analysis and Model Optimization; Basic Theories of Machine Learning and Emerging Application Technologies; and Intelligent Recommendation System Design and Privacy Security.Part II : Deep Learning Models and High-performance Computing; Data-driven Complex System Modeling and Intelligent Optimization Algorithms; and Image Analysis and Processing Methods based on AI.
R 3,895.87

Machine Learning In Pure Mathematics And Theoretical Physics
The terms 'machine learning', 'pure mathematics and theoretical physics' may first appear to be topics in two very different categories in mathematics and computer science, yet in the past five years, we have seen many articles published that combined machine learning techniques in the search for patterns using big data. The aim of this book, a first of its kind, is to collect research and survey articles from many experts in this emerging collaboration between theoretical mathematicians and computer scientists on topics ranging from combinatorics to number theory, to geometry, to quantum field theory and string theory.This book is put together with PhD students in mind as well as seasoned researchers, as a reference book for collection of publications that cross between mathematics and computer science.
R 6,295.12

R 988.33

Computational Learning Theory
Computational learning theory is a subject which has been advancing rapidly in the last few years. The authors concentrate on the probably approximately correct model of learning, and gradually develop the ideas of efficiency considerations. Finally, applications of the theory to artificial neural networks are considered. Many exercises are included throughout, and the list of references is extensive. This volume is relatively self contained as the necessary background material from logic, probability and complexity theory is included. It will therefore form an introduction to the theory of computational learning, suitable for a broad spectrum of graduate students from theoretical computer science and mathematics.
R 2,306.74

Algebraic Geometry and Statistical Learning Theory
Sure to be influential, this book lays the foundations for the use of algebraic geometry in statistical learning theory. Many widely used statistical models and learning machines applied to information science have a parameter space that is singular: mixture models, neural networks, HMMs, Bayesian networks, and stochastic context-free grammars are major examples. Algebraic geometry and singularity theory provide the necessary tools for studying such non-smooth models. Four main formulas are established: 1. the log likelihood function can be given a common standard form using resolution of singularities, even applied to more complex models; 2. the asymptotic behaviour of the marginal likelihood or 'the evidence' is derived based on zeta function theory; 3. new methods are derived to estimate the generalization errors in Bayes and Gibbs estimations from training errors; 4. the generalization errors of maximum likelihood and a posteriori methods are clarified by empirical process theory on algebraic varieties.
R 4,120.04

Derivative-Free Optimization
This book offers a pioneering exploration of classification-based derivative-free optimization (DFO), providing researchers and professionals in artificial intelligence, machine learning, AutoML, and optimization with a robust framework for addressing complex, large-scale problems where gradients are unavailable. By bridging theoretical foundations with practical implementations, it fills critical gaps in the field, making it an indispensable resource for both academic and industrial audiences. The book introduces innovative frameworks such as sampling-and-classification (SAC) and sampling-and-learning (SAL), which underpin cutting-edge algorithms like Racos and SRacos. These methods are designed to excel in challenging optimization scenarios, including high-dimensional search spaces, noisy environments, and parallel computing. A dedicated section on the ZOOpt toolbox provides practical tools for implementing these algorithms effectively. The book's structure moves from foundational principles and algorithmic development to advanced topics and real-world applications, such as hyperparameter tuning, neural architecture search, and algorithm selection in AutoML. Readers will benefit from a comprehensive yet concise presentation of modern DFO methods, gaining theoretical insights and practical tools to enhance their research and problem-solving capabilities. A foundational understanding of machine learning, probability theory, and algorithms is recommended for readers to fully engage with the material.
R 6,996.69







