Search results for "Python Exercises with Data Structures and Algorithms"
Items we need to order for you
Design and Analysis of Algorithms
These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts • A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. • M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. • R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references.
R 3,043.48
Algorithms in Bioinformatics
We are pleased to present the proceedings of the 5th Workshop on Algorithms in Bioinformatics (WABI 2005) which took place in Mallorca, Spain, October 3-6, 2005. The WABI 2005 workshop was part of the ?ve ALGO 2005 conf- ence meetings, which, in addition to WABI, included ESA, WAOA, IWPEC, and ATMOS. WABI 2005 was sponsored by EATCS (the European Assoc- tion for Theoretical Computer Science), the ISCB (the International Society for Computational Biology), the Universitat Polit' ecnica de Catalunya, the U- versitat de les Illes Balears, and the Ministerio de Educaci' on y Ciencia. See http://www.lsi.upc.edu/"wabi05/ for more details. The Workshop on Algorithms in Bioinformatics highlights research work speci?cally developed to address algorithmic problems in biosequence analysis. Theemphasisisthereforeonstatisticalandprobabilisticalgorithmsthataddress important problems in the ?eld of molecular and structural biology. At present, given the enormous scienti?c and technical e?orts in functional and structural genomics, the relevance of the problem is therefore constrained by the need for sound, e?cient and specialized algorithms, capable of achieving solutions that can be tested by the biological community.Indeed the ultimate goal is to - plement algorithms capable of extracting real features from real biological data sets. Therefore the workshop aims to present recent research results, including signi?cant work in progress, and to identify and explore directions of future research.
R 3,062.02
Algorithms and Programs
Algorithms power modern systems--from flight control and robotics to recommendation engines and AI applications. Algorithms and Programs: An AI-Assisted Approach shows how to clearly define an algorithm's purpose, design a structured outline, translate it into reliable code, and reason about its efficiency and complexity. Rather than relying on traditional pseudocode, this book uses precise algorithm outlines that are easier to understand and directly support correct implementation. This approach bridges the gap between design and code, reducing ambiguity and minimizing errors. Each algorithm is expressed as a sequence of clear, intended outcomes, which naturally define its correctness conditions and support reasoning about invariants and program behavior. This structured method encourages better programming practice, improves reliability, and aligns well with modern AI-assisted development tools. Practical approach to algorithms: Moves beyond traditional pseudocode to clear, structured algorithm outlines that directly translate into reliable code.Bridges theory and real-world programming: Helps learners and engineers connect algorithm design with implementation, correctness, and performance in everyday software development.Makes invariants intuitive and usable: Developed from decades of teaching experience, the book rethinks invariants in a practical, common-sense way that students and practitioners can actually apply.Designed for modern AI-assisted development: Aligns with how programming is done today, enabling AI-checkable algorithm structures that support correctness and reduce errors.Rooted in teaching and real industry experience: Inspired by long-term discussions with students and professional practice, addressing real gaps between academic concepts and industry needs.Strategic AI Thinking: Explore leverage from AI platforms that specify function requirements, outline appropriate algorithms, implement outlines, and inspect them reliably.
R 1,832.00
Hands-On Ensemble Learning with Python
Combine popular machine learning techniques to create ensemble models using PythonKey FeaturesImplement ensemble models using algorithms such as random forests and AdaBoostApply boosting, bagging, and stacking ensemble methods to improve the prediction accuracy of your model Explore real-world data sets and practical examples coded in scikit-learn and KerasBook DescriptionEnsembling is a technique of combining two or more similar or dissimilar machine learning algorithms to create a model that delivers superior predictive power. This book will demonstrate how you can use a variety of weak algorithms to make a strong predictive model.With its hands-on approach, you'll not only get up to speed on the basic theory but also the application of various ensemble learning techniques. Using examples and real-world datasets, you'll be able to produce better machine learning models to solve supervised learning problems such as classification and regression. Furthermore, you'll go on to leverage ensemble learning techniques such as clustering to produce unsupervised machine learning models. As you progress, the chapters will cover different machine learning algorithms that are widely used in the practical world to make predictions and classifications. You'll even get to grips with the use of Python libraries such as scikit-learn and Keras for implementing different ensemble models.By the end of this book, you will be well-versed in ensemble learning, and have the skills you need to understand which ensemble method is required for which problem, and successfully implement them in real-world scenarios.What you will learnImplement ensemble methods to generate models with high accuracyOvercome challenges such as bias and varianceExplore machine learning algorithms to evaluate model performanceUnderstand how to construct, evaluate, and apply ensemble modelsAnalyze tweets in real time using Twitter's streaming APIUse Keras to build an ensemble of neural networks for the MovieLens datasetWho this book is forThis book is for data analysts, data scientists, machine learning engineers and other professionals who are looking to generate advanced models using ensemble techniques. An understanding of Python code and basic knowledge of statistics is required to make the most out of this book.
R 1,498.00
Combinatorial Algorithms
This book constitutes the thoroughly refereed post-workshop proceedings of the 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, held in Duluth, MN, USA, in October 2014. The 32 revised full papers presented were carefully reviewed and selected from a total of 69 submissions. The papers focus on topics such as Algorithms and Data Structures, Combinatorial Enumeration, Combinatorial Optimization, Complexity Theory (Structural and Computational), Computational Biology, Databases (Security, Compression and Information Retrieval), Decompositions and Combinatorial Designs, Discrete and Computational Geometry, as well as Graph Drawing and Graph Theory. IWOCA is a yearly forum for researchers in designing algorithms field to advance creativeness of intersection between mathematics and computer science. This is the first time this conference is being held in U.S.
R 2,188.29
WALCOM: Algorithms and Computation
This book constitutes the thoroughly refereed conference proceedings of the 9th International Workshop on Algorithms and Computation, WALCOM 2015, held in Dhaka, Bangladesh, in February 2015. The 26 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 85 submissions. The papers are organized in topical sections on approximation algorithms, data structures and algorithms, computational geometry, combinatorial algorithms, distributed and online algorithms, graph drawing and algorithms, combinatorial problems and complexity, and graph enumeration and algorithms.
R 2,183.44
R 1,067.00
Lecture Notes on Bucket Algorithms
Hashing algorithms scramble data and create pseudo-uniform data distribu- tions. Bucket algorithms operate on raw untransformed data which are parti- tioned Into groups according to membership In equl-slzed d-dlmenslonal hyperrec- tangles, called cells or buckets. The bucket data structure Is rather sensitive to the distribution of the data. In these lecture notes, we attempt to explain the connection between the expected time of various bucket algorithms and the dis- tribution of the data. The results are Illustrated on standard searching, sorting and selection problems, as well as on a variety of problems In computational geometry and operations research. The notes grew partially from a graduate course on probability theory In computer science. I wish to thank Elizabeth Van Gulick for her help with the manuscript, and David Avis, Hanna AYukawa, Vasek Chvatal, Beatrice Devroye, Hossam EI Glndy, Duncan McCallum, Magda McCallum, Godfrled Toussaint and Sue Whltesldes"for making the School of Computer Science at McGill University such an enjoyable place. The work was supported by NSERC Grant A3456 and by FCAC Grant EQ-1679.INTRODUCTION 1 INTRODUCTION It Is not a secret that methods based upon the truncation of data have good expected time performance. For example, for nice distributions of the data, searching Is often better done via a hashing data structure Instead of via a search tree. The speed one observes In practice Is due to the fact that the truncation operation Is a constant time operation.
R 1,533.60
R 764.00
R 1,061.00
Applied Supervised Learning with Python
Explore the exciting world of machine learning with the fastest growing technology in the worldKey FeaturesUnderstand various machine learning concepts with real-world examplesImplement a supervised machine learning pipeline from data ingestion to validationGain insights into how you can use machine learning in everyday lifeBook DescriptionMachine learning—the ability of a machine to give right answers based on input data—has revolutionized the way we do business. Applied Supervised Learning with Python provides a rich understanding of how you can apply machine learning techniques in your data science projects using Python. You'll explore Jupyter Notebooks, the technology used commonly in academic and commercial circles with in-line code running support.With the help of fun examples, you'll gain experience working on the Python machine learning toolkit—from performing basic data cleaning and processing to working with a range of regression and classification algorithms. Once you’ve grasped the basics, you'll learn how to build and train your own models using advanced techniques such as decision trees, ensemble modeling, validation, and error metrics. You'll also learn data visualization techniques using powerful Python libraries such as Matplotlib and Seaborn. This book also covers ensemble modeling and random forest classifiers along with other methods for combining results from multiple models, and concludes by delving into cross-validation to test your algorithm and check how well the model works on unseen data.By the end of this book, you'll be equipped to not only work with machine learning algorithms, but also be able to create some of your own!What you will learnUnderstand the concept of supervised learning and its applicationsImplement common supervised learning algorithms using machine learning Python librariesValidate models using the k-fold techniqueBuild your models with decision trees to get results effortlesslyUse ensemble modeling techniques to improve the performance of your modelApply a variety of metrics to compare machine learning modelsWho this book is forApplied Supervised Learning with Python is for you if you want to gain a solid understanding of machine learning using Python. It'll help if you to have some experience in any functional or object-oriented language and a basic understanding of Python libraries and expressions, such as arrays and dictionaries.
R 1,498.00
Exercises in Numerical Linear Algebra and Matrix Factorizations
To put the world of linear algebra to advanced use, it is not enough to merely understand the theory; there is a significant gap between the theory of linear algebra and its myriad expressions in nearly every computational domain. To bridge this gap, it is essential to process the theory by solving many exercises, thus obtaining a firmer grasp of its diverse applications. Similarly, from a theoretical perspective, diving into the literature on advanced linear algebra often reveals more and more topics that are deferred to exercises instead of being treated in the main text. As exercises grow more complex and numerous, it becomes increasingly important to provide supporting material and guidelines on how to solve them, supporting students’ learning process. This book provides precisely this type of supporting material for the textbook “Numerical Linear Algebra and Matrix Factorizations,” published as Vol. 22 of Springer’s Texts in Computational Science and Engineering series. Instead of omitting details or merely providing rough outlines, this book offers detailed proofs, and connects the solutions to the corresponding results in the textbook. For the algorithmic exercises the utmost level of detail is provided in the form of MATLAB implementations. Both the textbook and solutions are self-contained. This book and the textbook are of similar length, demonstrating that solutions should not be considered a minor aspect when learning at advanced levels.
R 2,971.93
Combinatorial Algorithms
This book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics.
R 2,205.20
R 397.00
Logic and Theory of Algorithms
CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15–20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere,especially, in algebra,analysisand geometry, or data types and p- gramming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. Thisvolume,Logic andTheory of Algorithms,istheproceedingsofthefourth in a series of conferences of CiE that was held at the University of Athens, June 15–20, 2008.
R 3,090.38
Hands-On Web Scraping with Python
Work through practical examples to unlock the full potential of web scraping with Python and gain valuable insights from high-quality dataKey FeaturesBuild an initial portfolio of web scraping projects with detailed explanationsGrasp Python programming fundamentals related to web scraping and data extractionAcquire skills to code web scrapers, store data in desired formats, and employ the data professionallyPurchase of the print or Kindle book includes a free PDF eBookBook DescriptionWeb scraping is a powerful tool for extracting data from the web, but it can be daunting for those without a technical background. Designed for novices, this book will help you grasp the fundamentals of web scraping and Python programming, even if you have no prior experience.Adopting a practical, hands-on approach, this updated edition of Hands-On Web Scraping with Python uses real-world examples and exercises to explain key concepts. Starting with an introduction to web scraping fundamentals and Python programming, you’ll cover a range of scraping techniques, including requests, lxml, pyquery, Scrapy, and Beautiful Soup. You’ll also get to grips with advanced topics such as secure web handling, web APIs, Selenium for web scraping, PDF extraction, regex, data analysis, EDA reports, visualization, and machine learning.This book emphasizes the importance of learning by doing. Each chapter integrates examples that demonstrate practical techniques and related skills. By the end of this book, you’ll be equipped with the skills to extract data from websites, a solid understanding of web scraping and Python programming, and the confidence to use these skills in your projects for analysis, visualization, and information discovery.What you will learnMaster web scraping techniques to extract data from real-world websitesImplement popular web scraping libraries such as requests, lxml, Scrapy, and pyqueryDevelop advanced skills in web scraping, APIs, PDF extraction, regex, and machine learningAnalyze and visualize data with Pandas and PlotlyDevelop a practical portfolio to demonstrate your web scraping skillsUnderstand best practices and ethical concerns in web scraping and data extractionWho this book is forThis book is for beginners who want to learn web scraping and data extraction using Python. No prior programming knowledge is required, but a basic understanding of web-related concepts such as websites, browsers, and HTML is assumed. If you enjoy learning by doing and want to build a portfolio of web scraping projects and delve into data-related studies and application, then this book is tailored for your needs.
R 1,531.00
Modern Data Mining Algorithms in C++ and CUDA C
Discover a variety of data-mining algorithms that are useful for selecting small sets of important features from among unwieldy masses of candidates, or extracting useful features from measured variables. As a serious data miner you will often be faced with thousands of candidate features for your prediction or classification application, with most of the features being of little or no value. You’ll know that many of these features may be useful only in combination with certain other features while being practically worthless alone or in combination with most others. Some features may have enormous predictive power, but only within a small, specialized area of the feature space. The problems that plague modern data miners are endless. This book helps you solve this problem by presenting modern feature selection techniques and the code to implement them. Some of these techniques are:Forward selection component analysisLocal feature selectionLinking features and a target with a hidden Markov modelImprovements on traditional stepwise selectionNominal-to-ordinal conversion All algorithms are intuitively justified and supported by the relevant equations and explanatory material. The author also presents and explains complete, highly commented source code. The example code is in C++ and CUDA C but Python or other code can be substituted; the algorithm is important, not the code that's used to write it. What You Will LearnCombine principal component analysis with forward and backward stepwise selection to identify a compact subset of a large collection of variables that captures the maximum possible variation within the entire set.Identify features that may have predictive power over only a small subset of the feature domain. Such features can be profitably used by modern predictive models but may be missed by other feature selection methods.Find an underlying hidden Markov model that controls the distributions of feature variables and the target simultaneously. The memory inherent in this method is especially valuable in high-noise applications such as prediction of financial markets.Improve traditional stepwise selection in three ways: examine a collection of 'best-so-far' feature sets; test candidate features for inclusion with cross validation to automatically and effectively limit model complexity; and at each step estimate the probability that our results so far could be just the product of random good luck. We also estimate the probability that the improvement obtained by adding a new variable could have been just good luck. Take a potentially valuable nominal variable (a category or class membership) that is unsuitable for input to a prediction model, and assign to each category a sensible numeric value that can be used as a model input. Who This Book Is For Intermediate to advanced data science programmers and analysts.
R 1,693.78
Introduction to the Design and Analysis of Algorithms
Based on a new classification of algorithm design techniques and a clear delineation of analysis methods, Introduction to the Design and Analysis of Algorithms presents the subject in a coherent and innovative manner. Written in a student-friendly style, the book emphasizes the understanding of ideas over excessively formal treatment while thoroughly covering the material required in an introductory algorithms course. Popular puzzles are used to motivate students' interest and strengthen their skills in algorithmic problem solving. Other learning-enhancement features include chapter summaries, hints to the exercises, and a detailed solution manual.
R 6,473.00
Guide to Graph Algorithms
This book A Guide to Graph Algorithms offers high-quality content in the research area of graph algorithms and explores the latest developments in graph algorithmics. The reader will gain a comprehensive understanding of how to use algorithms to explore graphs. It is a collection of texts that have proved to be trend setters and good examples of that. The book aims at providing the reader with a deep understanding of the structural properties of graphs that are useful for the design of efficient algorithms. These algorithms have applications in finite state machine modelling, social network theory, biology, and mathematics. The book contains many exercises, some up at present-day research-level. The exercises encourage the reader to discover new techniques by putting things in a clear perspective. A study of this book will provide the reader with many powerful tools to model and tackle problems in real-world scenarios.
R 2,381.00
Applied Data Science with Python and Jupyter
Become the master player of data exploration by creating reproducible data processing pipelines, visualizations, and prediction models for your applications.Key FeaturesGet up and running with the Jupyter ecosystem and some example datasetsLearn about key machine learning concepts such as SVM, KNN classifiers, and Random ForestsDiscover how you can use web scraping to gather and parse your own bespoke datasetsBook DescriptionGetting started with data science doesn't have to be an uphill battle. Applied Data Science with Python and Jupyter is a step-by-step guide ideal for beginners who know a little Python and are looking for a quick, fast-paced introduction to these concepts. In this book, you'll learn every aspect of the standard data workflow process, including collecting, cleaning, investigating, visualizing, and modeling data. You'll start with the basics of Jupyter, which will be the backbone of the book. After familiarizing ourselves with its standard features, you'll look at an example of it in practice with our first analysis. In the next lesson, you dive right into predictive analytics, where multiple classification algorithms are implemented. Finally, the book ends by looking at data collection techniques. You'll see how web data can be acquired with scraping techniques and via APIs, and then briefly explore interactive visualizations.What you will learnGet up and running with the Jupyter ecosystemIdentify potential areas of investigation and perform exploratory data analysisPlan a machine learning classification strategy and train classification modelsUse validation curves and dimensionality reduction to tune and enhance your modelsScrape tabular data from web pages and transform it into Pandas DataFramesCreate interactive, web-friendly visualizations to clearly communicate your findingsWho this book is forApplied Data Science with Python and Jupyter is ideal for professionals with a variety of job descriptions across a large range of industries, given the rising popularity and accessibility of data science. You'll need some prior experience with Python, with any prior work with libraries such as Pandas, Matplotlib, and Pandas providing you a useful head start.
R 1,140.00
WALCOM: Algorithms and Computation
This book constitutes the proceedings of the 12th International Workshop on Algorithms and Computation, WALCOM 2018, held in Dhaka, Bangladesh, in March 2018.The 22 full papers presented were carefully reviewed and selected from 50 submissions. The papers cover diverse areas of algorithms and computation, such as approximation algorithms, computational geometry, combinatorial algorithms, computational biology, computational complexity, data structures, graph and network algorithms, and online algorithms.
R 2,171.83
Algorithms
Algorithms: Technology, Culture, Politics develops a relational, situated approach to algorithms. It takes a middle ground between theories that give the algorithm a singular and stable meaning in using it as a central analytic category for contemporary society and theories that dissolve the term into the details of empirical studies.The book discusses algorithms in relation to hardware and material conditions, code, data, and subjects such as users, programmers, but also “data doubles”. The individual chapters bridge critical discussions on bias, exclusion, or responsibility with the necessary detail on the contemporary state of information technology. The examples include state of the art applications of machine learning, such as self-driving cars and large language models such as GPT.The book will be of interest for everyone engaging critically with algorithms, particularly in the social sciences, media studies, STS, political theory, or philosophy. With its broad scope it can serve as a high-level introduction that picks up and builds on more than two decades of critical research on algorithms.
R 9,302.33
Hands-on Time Series Analysis with Python
Learn the concepts of time series from traditional to bleeding-edge techniques. This book uses comprehensive examples to clearly illustrate statistical approaches and methods of analyzing time series data and its utilization in the real world. All the code is available in Jupyter notebooks.You'll begin by reviewing time series fundamentals, the structure of time series data, pre-processing, and how to craft the features through data wrangling. Next, you'll look at traditional time series techniques like ARMA, SARIMAX, VAR, and VARMA using trending framework like StatsModels and pmdarima. The book also explains building classification models using sktime, and covers advanced deep learning-based techniques like ANN, CNN, RNN, LSTM, GRU and Autoencoder to solve time series problem using Tensorflow. It concludes by explaining the popular framework fbprophet for modeling time series analysis. After reading Hands -On Time Series Analysis with Python, you'll be able to apply these new techniques in industries, such as oil and gas, robotics, manufacturing, government, banking, retail, healthcare, and more. What You'll Learn:· Explains basics to advanced concepts of time series· How to design, develop, train, and validate time-series methodologies· What are smoothing, ARMA, ARIMA, SARIMA,SRIMAX, VAR, VARMA techniques in time series and how to optimally tune parameters to yield best results· Learn how to leverage bleeding-edge techniques such as ANN, CNN, RNN, LSTM, GRU, Autoencoder to solve both Univariate and multivariate problems by using two types of data preparation methods for time series.· Univariate and multivariate problem solving using fbprophet. Who This Book Is ForData scientists, data analysts, financial analysts, and stock market researchers
R 1,254.00
Algorithms and Complexity
This book constitutes the refereed conference proceedings of the 11th International Conference on Algorithms and Complexity, CIAC 2019, held in Rome, Italy, in May 2019.The 30 full papers were carefully reviewed and selected from 95 submissions. The International Conference on Algorithms and Complexity is intended to provide a forum for researchers working in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. The papers present original research in the theory and applications of algorithms and computational complexity.
R 2,952.17
Experimental Algorithms
This volume contains the papers presented at the 8th International Symposium on Experimental Algorithms (SEA 2009).The symposium was held at the Te- nische Universit. at Dortmund, Germany, during June 4-6, 2009. The main theme of the SEA series is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. Contributions are supported by experimental evaluation, methodological issues in the design and interpretation of experiments, the use of (meta-)heuristics, or application-driven case studies that deepen the und- standing of a problem's complexity. For each symposium, papers are solicited from all areas of algorithmic engineering research. Previous meetings, under the name of "Workshop on Experimental Al- rithms" (WEA), were held in Riga (Latvia, 2001), Ascona (Switzerland, 2003), Angra dos Reis (Brazil, 2004), Santorini (Greece, 2005), Menorca Island (Spain, 2006), Rome (Italy, 2007), and Provincetown (USA, 2008). The ProgramCommittee ofSEA 2009received64 submissions.Eachsubm- sion was reviewed by at least three ProgramCommittee members and evaluated on its quality,originality,and relevance to the symposium.Overall,the Program Committee wrote249 reviews with the help of almost 100 trusted external ref- ees. The Committee selected 23 papers, leading to an acceptance rate of 35.9%. The decision process was made electronically using the EasyChair conference management system. In additionto the accepted contributions,this volumealso containsabstracts ofthe invitedtalks givenby Heinz Bast(Intel), MichaelA. Bender (Stony Brook University and Tokutek, Inc.), and Marc Schoenauer (INRIA Saclay - Ile-de- France).
R 2,365.14
R 749.44
Neural Network Projects with Python
Build your Machine Learning portfolio by creating 6 cutting-edge Artificial Intelligence projects using neural networks in PythonKey FeaturesDiscover neural network architectures (like CNN and LSTM) that are driving recent advancements in AIBuild expert neural networks in Python using popular libraries such as KerasIncludes projects such as object detection, face identification, sentiment analysis, and moreBook DescriptionNeural networks are at the core of recent AI advances, providing some of the best resolutions to many real-world problems, including image recognition, medical diagnosis, text analysis, and more. This book goes through some basic neural network and deep learning concepts, as well as some popular libraries in Python for implementing them.It contains practical demonstrations of neural networks in domains such as fare prediction, image classification, sentiment analysis, and more. In each case, the book provides a problem statement, the specific neural network architecture required to tackle that problem, the reasoning behind the algorithm used, and the associated Python code to implement the solution from scratch. In the process, you will gain hands-on experience with using popular Python libraries such as Keras to build and train your own neural networks from scratch.By the end of this book, you will have mastered the different neural network architectures and created cutting-edge AI projects in Python that will immediately strengthen your machine learning portfolio.What you will learnLearn various neural network architectures and its advancements in AIMaster deep learning in Python by building and training neural networkMaster neural networks for regression and classificationDiscover convolutional neural networks for image recognitionLearn sentiment analysis on textual data using Long Short-Term MemoryBuild and train a highly accurate facial recognition security systemWho this book is forThis book is a perfect match for data scientists, machine learning engineers, and deep learning enthusiasts who wish to create practical neural network projects in Python. Readers should already have some basic knowledge of machine learning and neural networks.
R 1,498.00
Experimental Algorithms
This book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016.The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities.
R 2,190.48
Beyond Databases, Architectures and Structures. Paving the Road to Smart Data Processing and Analysis
This book constitutes the refereed proceedings of the 15th International Conference entitled Beyond Databases, Architectures and Structures, BDAS 2019, held in Ustroń, Poland, in May 2019.It consists of 26 carefully reviewed papers selected from 69 submissions. The papers are organized in topical sections, namely big data and cloud computing; architectures, structures and algorithms for efficient data processing and analysis; artificial intelligence, data mining and knowledge discovery; image analysis and multimedia mining; bioinformatics and biomedical data analysis; industrial applications; networks and security.
R 2,188.00
Automated Verification of Concurrent Search Structures
Search structures support the fundamental data storage primitives on key-value pairs: insert a pair, delete by key, search by key, and update the value associated with a key. Concurrent search structures are parallel algorithms to speed access to search structures on multicore and distributed servers. These sophisticated algorithms perform fine-grained synchronization between threads, making them notoriously difficult to design correctly. Indeed, bugs have been found both in actual implementations and in the designs proposed by experts in peer-reviewed publications. The rapid development and deployment of these concurrent algorithms has resulted in a rift between the algorithms that can be verified by the state-of-the-art techniques and those being developed and used today. The goal of this book is to show how to bridge this gap in order to bring the certified safety of formal verification to high-performance concurrent search structures. Similar techniques and frameworks can be applied to concurrent graph and network algorithms beyond search structures.
R 2,252.93
Hands-On Meta Learning with Python
Explore a diverse set of meta-learning algorithms and techniques to enable human-like cognition for your machine learning models using various Python frameworksKey FeaturesUnderstand the foundations of meta learning algorithmsExplore practical examples to explore various one-shot learning algorithms with its applications in TensorFlowMaster state of the art meta learning algorithms like MAML, reptile, meta SGDBook DescriptionMeta learning is an exciting research trend in machine learning, which enables a model to understand the learning process. Unlike other ML paradigms, with meta learning you can learn from small datasets faster.Hands-On Meta Learning with Python starts by explaining the fundamentals of meta learning and helps you understand the concept of learning to learn. You will delve into various one-shot learning algorithms, like siamese, prototypical, relation and memory-augmented networks by implementing them in TensorFlow and Keras. As you make your way through the book, you will dive into state-of-the-art meta learning algorithms such as MAML, Reptile, and CAML. You will then explore how to learn quickly with Meta-SGD and discover how you can perform unsupervised learning using meta learning with CACTUs. In the concluding chapters, you will work through recent trends in meta learning such as adversarial meta learning, task agnostic meta learning, and meta imitation learning.By the end of this book, you will be familiar with state-of-the-art meta learning algorithms and able to enable human-like cognition for your machine learning models.What you will learnUnderstand the basics of meta learning methods, algorithms, and typesBuild voice and face recognition models using a siamese networkLearn the prototypical network along with its variantsBuild relation networks and matching networks from scratchImplement MAML and Reptile algorithms from scratch in PythonWork through imitation learning and adversarial meta learningExplore task agnostic meta learning and deep meta learningWho this book is forHands-On Meta Learning with Python is for machine learning enthusiasts, AI researchers, and data scientists who want to explore meta learning as an advanced approach for training machine learning models. Working knowledge of machine learning concepts and Python programming is necessary.
R 1,498.00
Algorithms and Computation
This book constitutes the refereed proceedings of the 24th International Symposium on Algorithms and Computation, ISAAC 2013, held in Hong Kong, China in December 2013. The 67 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 177 submissions for inclusion in the book. The focus of the volume in on the following topics: computation geometry, pattern matching, computational complexity, internet and social network algorithms, graph theory and algorithms, scheduling algorithms, fixed-parameter tractable algorithms, algorithms and data structures, algorithmic game theory, approximation algorithms and network algorithms.
R 2,249.41
R 670.15
Practical Natural Language Processing with Python
Work with natural language tools and techniques to solve real-world problems. This book focuses on how natural language processing (NLP) is used in various industries. Each chapter describes the problem and solution strategy, then provides an intuitive explanation of how different algorithms work and a deeper dive on code and output in Python. Practical Natural Language Processing with Python follows a case study-based approach. Each chapter is devoted to an industry or a use case, where you address the real business problems in that industry and the various ways to solve them. You start with various types of text data before focusing on the customer service industry, the type of data available in that domain, and the common NLP problems encountered. Here you cover the bag-of-words model supervised learning technique as you try to solve the case studies. Similar depth is given to other use cases such as online reviews, bots, finance, and so on. As you cover the problems in these industries you’ll also cover sentiment analysis, named entity recognition, word2vec, word similarities, topic modeling, deep learning, and sequence to sequence modelling. By the end of the book, you will be able to handle all types of NLP problems independently. You will also be able to think in different ways to solve language problems. Code and techniques for all the problems are provided in the book.What You Will LearnBuild an understanding of NLP problems in industryGain the know-how to solve a typical NLP problem using language-based models and machine learningDiscover the best methods to solve a business problem using NLP - the tried and tested onesUnderstand the business problems that are tough to solve Who This Book Is ForAnalytics and data science professionals who want to kick start NLP, and NLP professionals who want to get new ideas to solve the problems at hand.
R 1,254.00
R 1,143.68
Statistics and Data Visualization in Climate Science with R and Python
A comprehensive overview of essential statistical concepts, useful statistical methods, data visualization, and modern computing tools for the climate sciences and many others such as geography and environmental engineering. It is an invaluable reference for students and researchers in climatology and its connected fields who wish to learn data science, statistics, R and Python programming. The examples and exercises in the book empower readers to work on real climate data from station observations, remote sensing and simulated results. For example, students can use R or Python code to read and plot the global warming data and the global precipitation data in netCDF, csv, txt, or JSON; and compute and interpret empirical orthogonal functions. The book's computer code and real-world data allow readers to fully utilize the modern computing technology and updated datasets. Online supplementary resources include R code and Python code, data files, figure files, tutorials, slides and sample syllabi.
R 2,526.00
Experimental Algorithms
This book constitutes the refereed proceedings of the 12th International Symposium on Experimental Algorithms, SEA 2013, held in Rome, Italy, in June 2013. The 32 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on transportation networks and graph algorithms, combinatorics and enumeration, data structures and compression, network partitioning and bioinformatics, mathematical programming, geometry and optimization, and scheduling and local search.
R 2,194.76
R 551.40
Handbook of Applied Algorithms
Discover the benefits of applying algorithms to solve scientific, engineering, and practical problems Providing a combination of theory, algorithms, and simulations, Handbook of Applied Algorithms presents an all-encompassing treatment of applying algorithms and discrete mathematics to practical problems in "hot" application areas, such as computational biology, computational chemistry, wireless networks, and computer vision. In eighteen self-contained chapters, this timely book explores: * Localized algorithms that can be used in topology control for wireless ad-hoc or sensor networks * Bioinformatics algorithms for analyzing data * Clustering algorithms and identification of association rules in data mining * Applications of combinatorial algorithms and graph theory in chemistry and molecular biology * Optimizing the frequency planning of a GSM network using evolutionary algorithms * Algorithmic solutions and advances achieved through game theory Complete with exercises for readers to measure their comprehension of the material presented, Handbook of Applied Algorithms is a much-needed resource for researchers, practitioners, and students within computer science, life science, and engineering. Amiya Nayak, PhD, has over seventeen years of industrial experience and is Full Professor at the School of Information Technology and Engineering at the University of Ottawa, Canada. He is on the editorial board of several journals. Dr. Nayak's research interests are in the areas of fault tolerance, distributed systems/algorithms, and mobile ad-hoc networks. Ivan StojmenoviC?, PhD, is Professor at the University of Ottawa, Canada (www.site.uottawa.ca/~ivan), and Chair Professor of Applied Computing at the University of Birmingham, United Kingdom. Dr. Stojmenovic? received the Royal Society Wolfson Research Merit Award. His current research interests are mostly in the design and analysis of algorithms for wireless ad-hoc and sensor networks.
R 5,209.00
Pro Machine Learning Algorithms
Bridge the gap between a high-level understanding of how an algorithm works and knowing the nuts and bolts to tune your models better. This book will give you the confidence and skills when developing all the major machine learning models. In Pro Machine Learning Algorithms, you will first develop the algorithm in Excel so that you get a practical understanding of all the levers that can be tuned in a model, before implementing the models in Python/R.You will cover all the major algorithms: supervised and unsupervised learning, which include linear/logistic regression; k-means clustering; PCA; recommender system; decision tree; random forest; GBM; and neural networks. You will also be exposed to the latest in deep learning through CNNs, RNNs, and word2vec for text mining. You will be learning not only the algorithms, but also the concepts of feature engineering to maximize the performance of a model. You will see the theory along with case studies, such as sentiment classification, fraud detection, recommender systems, and image recognition, so that you get the best of both theory and practice for the vast majority of the machine learning algorithms used in industry. Along with learning the algorithms, you will also be exposed to running machine-learning models on all the major cloud service providers.You are expected to have minimal knowledge of statistics/software programming and by the end of this book you should be able to work on a machine learning project with confidence. What You Will LearnGet an in-depth understanding of all the major machine learning and deep learning algorithms Fully appreciate the pitfalls to avoid while building modelsImplement machine learning algorithms in the cloud Follow a hands-on approach through case studies for each algorithmGain the tricks of ensemble learning to build more accurate modelsDiscover the basics of programming in R/Python and the Keras framework for deep learningWho This Book Is ForBusiness analysts/ IT professionals who want to transition into data science roles. Data scientists who want to solidify their knowledge in machine learning.
R 1,736.45
Mastering Machine Learning Algorithms
Updated and revised second edition of the bestselling guide to exploring and mastering the most important algorithms for solving complex machine learning problemsKey FeaturesUpdated to include new algorithms and techniquesCode updated to Python 3.8 & TensorFlow 2.x New coverage of regression analysis, time series analysis, deep learning models, and cutting-edge applicationsBook DescriptionMastering Machine Learning Algorithms, Second Edition helps you harness the real power of machine learning algorithms in order to implement smarter ways of meeting today's overwhelming data needs. This newly updated and revised guide will help you master algorithms used widely in semi-supervised learning, reinforcement learning, supervised learning, and unsupervised learning domains.You will use all the modern libraries from the Python ecosystem – including NumPy and Keras – to extract features from varied complexities of data. Ranging from Bayesian models to the Markov chain Monte Carlo algorithm to Hidden Markov models, this machine learning book teaches you how to extract features from your dataset, perform complex dimensionality reduction, and train supervised and semi-supervised models by making use of Python-based libraries such as scikit-learn. You will also discover practical applications for complex techniques such as maximum likelihood estimation, Hebbian learning, and ensemble learning, and how to use TensorFlow 2.x to train effective deep neural networks.By the end of this book, you will be ready to implement and solve end-to-end machine learning problems and use case scenarios.What you will learnUnderstand the characteristics of a machine learning algorithmImplement algorithms from supervised, semi-supervised, unsupervised, and RL domainsLearn how regression works in time-series analysis and risk predictionCreate, model, and train complex probabilistic models Cluster high-dimensional data and evaluate model accuracy Discover how artificial neural networks work – train, optimize, and validate them Work with autoencoders, Hebbian networks, and GANsWho this book is forThis book is for data science professionals who want to delve into complex ML algorithms to understand how various machine learning models can be built. Knowledge of Python programming is required.
R 1,661.00
Machine Learning Algorithms
An easy-to-follow, step-by-step guide for getting to grips with the real-world application of machine learning algorithmsKey FeaturesExplore statistics and complex mathematics for data-intensive applicationsDiscover new developments in EM algorithm, PCA, and bayesian regressionStudy patterns and make predictions across various datasetsBook DescriptionMachine learning has gained tremendous popularity for its powerful and fast predictions with large datasets. However, the true forces behind its powerful output are the complex algorithms involving substantial statistical analysis that churn large datasets and generate substantial insight.This second edition of Machine Learning Algorithms walks you through prominent development outcomes that have taken place relating to machine learning algorithms, which constitute major contributions to the machine learning process and help you to strengthen and master statistical interpretation across the areas of supervised, semi-supervised, and reinforcement learning. Once the core concepts of an algorithm have been covered, you’ll explore real-world examples based on the most diffused libraries, such as scikit-learn, NLTK, TensorFlow, and Keras. You will discover new topics such as principal component analysis (PCA), independent component analysis (ICA), Bayesian regression, discriminant analysis, advanced clustering, and gaussian mixture.By the end of this book, you will have studied machine learning algorithms and be able to put them into production to make your machine learning applications more innovative.What you will learnStudy feature selection and the feature engineering processAssess performance and error trade-offs for linear regressionBuild a data model and understand how it works by using different types of algorithmLearn to tune the parameters of Support Vector Machines (SVM)Explore the concept of natural language processing (NLP) and recommendation systemsCreate a machine learning architecture from scratchWho this book is forMachine Learning Algorithms is for you if you are a machine learning engineer, data engineer, or junior data scientist who wants to advance in the field of predictive analytics and machine learning. Familiarity with R and Python will be an added advantage for getting the best from this book.
R 1,889.00
R 482.00
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
Algorithms and Computation
This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms.
R 2,253.69
