book

Artificial Intelligence and Machine Learning Fundamentals

Name: Artificial Intelligence and Machine Learning Fundamentals
Author: Zsolt Nagy
ISBN: 9781789801651

by Zsolt Nagy

December 2018

Beginner

330 pages

5h 45m

English

Packt Publishing

Read now

Unlock full access

Preface
About the BookAbout the AuthorObjectivesAudienceApproachMinimum Hardware RequirementsSoftware RequirementsConventionsInstallation and SetupStarting AnacondaAdditional Resources
Principles of Artificial Intelligence
IntroductionHow does AI Solve Real World Problems?Diversity of DisciplinesFields and Applications of Artificial IntelligenceSimulating Intelligence – The Turing TestAI Tools and Learning ModelsClassification and PredictionLearning ModelsThe Role of Python in Artificial IntelligenceWhy is Python Dominant in Machine Learning, Data Science, and AI? Anaconda in PythonPython Libraries for Artificial IntelligenceA Brief Introduction to the NumPy LibraryExercise 1: Matrix Operations Using NumPyPython for Game AIIntelligent Agents in GamesBreadth First Search and Depth First SearchExploring the State Space of a GameExercise 2: Estimating the Number of Possible States in Tic-Tac-Toe GameExercise 3: Creating an AI RandomlyActivity 1: Generating All Possible Sequences of Steps in a Tic-Tac-Toe GameSummary
AI with Search Techniques and Games
IntroductionExercise 4: Teaching the Agent to WinActivity 2: Teaching the Agent to Realize Situations When It Defends Against LossesActivity 3: Fixing the First and Second Moves of the AI to Make it InvincibleHeuristicsUninformed and Informed SearchCreating HeuristicsAdmissible and Non-Admissible HeuristicsHeuristic EvaluationExercise 5: Tic-Tac-Toe Static Evaluation with a Heuristic FunctionUsing Heuristics for an Informed SearchTypes of HeuristicsPathfinding with the A* AlgorithmExercise 6: Finding the Shortest Path to Reach a GoalExercise 7: Finding the Shortest Path Using BFSIntroducing the A* AlgorithmA* Search in Practice Using the simpleai LibraryGame AI with the Minmax Algorithm and Alpha-Beta Pruning Search Algorithms for Turn-Based Multiplayer GamesThe Minmax AlgorithmOptimizing the Minmax Algorithm with Alpha-Beta PruningDRYing up the Minmax Algorithm – The NegaMax AlgorithmUsing the EasyAI Library Activity 4: Connect FourSummary
Regression
IntroductionLinear Regression with One VariableWhat Is Regression?Features and LabelsFeature ScalingCross-Validation with Training and Test DataFitting a Model on Data with scikit-learn Linear Regression Using NumPy ArraysFitting a Model Using NumPy PolyfitPredicting Values with Linear RegressionActivity 5: Predicting PopulationLinear Regression with Multiple VariablesMultiple Linear RegressionThe Process of Linear RegressionImporting Data from Data SourcesLoading Stock Prices with Yahoo FinanceLoading Files with pandasLoading Stock Prices with QuandlExercise 8: Using Quandl to Load Stock PricesPreparing Data for PredictionPerforming and Validating Linear RegressionPredicting the FuturePolynomial and Support Vector RegressionPolynomial Regression with One VariableExercise 9: 1st, 2nd, and 3rd Degree Polynomial RegressionPolynomial Regression with Multiple VariablesSupport Vector RegressionSupport Vector Machines with a 3 Degree Polynomial KernelActivity 6: Stock Price Prediction with Quadratic and Cubic Linear Polynomial Regression with Multiple VariablesSummary
Classification
IntroductionThe Fundamentals of ClassificationExercise 10: Loading DatasetsData PreprocessingExercise 11: Pre-Processing DataMinmax Scaling of the Goal ColumnIdentifying Features and LabelsCross-Validation with scikit-learnActivity 7: Preparing Credit Data for ClassificationThe k-nearest neighbor ClassifierIntroducing the K-Nearest Neighbor AlgorithmDistance FunctionsExercise 12: Illustrating the K-nearest Neighbor Classifier AlgorithmExercise 13: k-nearest Neighbor Classification in scikit-learnExercise 14: Prediction with the k-nearest neighbors classifierParameterization of the k-nearest neighbor Classifier in scikit-learnActivity 8: Increasing the Accuracy of Credit ScoringClassification with Support Vector MachinesWhat are Support Vector Machine Classifiers?Understanding Support Vector MachinesSupport Vector Machines in scikit-learnParameters of the scikit-learn SVMActivity 9: Support Vector Machine Optimization in scikit-learnSummary
Using Trees for Predictive Analysis
Introduction to Decision TreesEntropyExercise 15: Calculating the EntropyInformation GainGini ImpurityExit ConditionBuilding Decision Tree Classifiers using scikit-learnEvaluating the Performance of ClassifiersExercise 16: Precision and RecallExercise 17: Calculating the F1 ScoreConfusion MatrixExercise 18: Confusion MatrixActivity 10: Car Data ClassificationRandom Forest ClassifierConstructing a Random ForestRandom Forest Classification Using scikit-learnParameterization of the random forest classifierFeature ImportanceExtremely Randomized TreesActivity 11: Random Forest Classification for Your Car Rental CompanySummary
Clustering
Introduction to ClusteringDefining the Clustering ProblemClustering ApproachesClustering Algorithms Supported by scikit-learnThe k-means AlgorithmExercise 19: k-means in scikit-learnParameterization of the k-means Algorithm in scikit-learnExercise 20: Retrieving the Center Points and the Labelsk-means Clustering of Sales DataActivity 12: k-means Clustering of Sales DataMean Shift AlgorithmExercise 21: Illustrating Mean Shift in 2DMean Shift Algorithm in scikit-learnImage Processing in PythonActivity 13: Shape Recognition with the Mean Shift AlgorithmSummary
Deep Learning with Neural Networks
Introduction TensorFlow for PythonInstalling TensorFlow in the Anaconda NavigatorTensorFlow OperationsExercise 22: Using Basic Operations and TensorFlow constantsPlaceholders and VariablesGlobal Variables InitializerIntroduction to Neural NetworksBiasesUse Cases for Artificial Neural NetworksActivation FunctionsExercise 23: Activation FunctionsForward and Backward PropagationConfiguring a Neural NetworkImporting the TensorFlow Digit DatasetModeling Features and LabelsTensorFlow Modeling for Multiple LabelsOptimizing the VariablesTraining the TensorFlow ModelUsing the Model for PredictionTesting the ModelRandomizing the Sample SizeActivity 14: Written Digit DetectionDeep LearningAdding LayersConvolutional Neural NetworksActivity 15: Written Digit Detection with Deep LearningSummary
Appendix
Chapter 1: Principles of AIActivity 1: Generating All Possible Sequences of Steps in the tic-tac-toe GameChapter 2: AI with Search Techniques and GamesActivity 2: Teach the agent realize situations when it defends against lossesActivity 3: Fix the first and second moves of the AI to make it invincibleActivity 4: Connect FourChapter 3: RegressionActivity 5: Predicting PopulationActivity 6: Stock Price Prediction with Quadratic and Cubic Linear Polynomial Regression with Multiple VariablesChapter 4: ClassificationActivity 7: Preparing Credit Data for ClassificationActivity 8: Increase the accuracy of credit scoringActivity 9: Support Vector Machine Optimization in scikit-learnChapter 5: Using Trees for Predictive AnalysisActivity 10: Car Data ClassificationActivity 11: Random Forest Classification for your Car Rental CompanyChapter 6: ClusteringActivity 12: k-means Clustering of Sales Data Activity 13: Shape Recognition with the Mean Shift algorithmChapter 7: Deep Learning with Neural Networks Activity 14: Written digit detectionActivity 15 : Written Digit Detection with Deep Learning

Content preview from Artificial Intelligence and Machine Learning Fundamentals

Using Trees for Predictive Analysis

Learning Objectives

By the end of this chapter, you will be able to:

Understand the metrics used for evaluating the utility of a data model
Classify datapoints based on decision trees
Classify datapoints based on the random forest algorithm

In this chapter, we will learn about two types of supervised learning algorithm in detail. The first algorithm will help us to classify data points using decision trees, while the other algorithm will help us classify using random forests.

Introduction to Decision Trees

In decision trees, we have input and corresponding output in the training data. A decision tree, like any tree, has leaves, branches, and nodes. Leaves are the end nodes like a yes or no. Nodes ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Artificial Intelligence and Machine Learning Fundamentals

Publisher Resources

ISBN: 9781789801651

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design