Get in Touch
 Duration 21 hours

Course Outline

Introduction

This section offers a broad overview of the contexts in which 'machine learning' is applicable, key considerations, and its implications, including advantages and limitations. It addresses datatypes (structured, unstructured, static, streamed), data validity and volume, data-driven versus user-driven analytics, statistical models versus machine learning models, the challenges of unsupervised learning, the bias-variance trade-off, iteration and evaluation, cross-validation approaches, and the distinctions between supervised, unsupervised, and reinforcement learning.

MAJOR TOPICS

1. Comprehending Naive Bayes

  • Foundational concepts of Bayesian methods
  • Probability theory
  • Joint probability
  • Conditional probability via Bayes' theorem
  • The Naive Bayes algorithm
  • Naive Bayes classification
  • The Laplace estimator
  • Incorporating numeric features into Naive Bayes

2. Comprehending Decision Trees

  • The divide and conquer strategy
  • The C5.0 decision tree algorithm
  • Selecting the optimal split
  • Pruning the decision tree

3. Comprehending Neural Networks

  • Transitioning from biological to artificial neurons
  • Activation functions
  • Network topology
  • Determining the number of layers
  • The direction of information flow
  • Sizing the number of nodes per layer
  • Training neural networks using backpropagation
  • Deep Learning

4. Comprehending Support Vector Machines

  • Classification via hyperplanes
  • Identifying the maximum margin
  • Handling linearly separable data
  • Handling non-linearly separable data
  • Applying kernels for non-linear spaces

5. Comprehending Clustering

  • Clustering as a machine learning objective
  • The k-means clustering algorithm
  • Utilizing distance for cluster assignment and updates
  • Selecting the optimal number of clusters

6. Assessing Classification Performance

  • Handling classification prediction data
  • An in-depth analysis of confusion matrices
  • Using confusion matrices to gauge performance
  • Metrics beyond accuracy
  • The kappa statistic
  • Sensitivity and specificity
  • Precision and recall
  • The F-measure
  • Visualizing performance trade-offs
  • ROC curves
  • Estimating future performance
  • The holdout method
  • Cross-validation
  • Bootstrap sampling

7. Optimizing Standard Models for Enhanced Performance

  • Leveraging caret for automated parameter tuning
  • Constructing a simple tuned model
  • Customizing the tuning workflow
  • Enhancing model performance through meta-learning
  • Understanding ensembles
  • Bagging
  • Boosting
  • Random forests
  • Training random forests
  • Evaluating random forest performance

MINOR TOPICS

8. Classification Using Nearest Neighbors

  • The kNN algorithm
  • Distance calculation
  • Selecting an appropriate k value
  • Data preparation for kNN
  • The lazy nature of the kNN algorithm

9. Understanding Classification Rules

  • The separate and conquer approach
  • The One Rule algorithm
  • The RIPPER algorithm
  • Deriving rules from decision trees

10. Understanding Regression

  • Simple linear regression
  • Ordinary least squares estimation
  • Correlation analysis
  • Multiple linear regression

11. Regression Trees and Model Trees

  • Incorporating regression into tree structures

12. Understanding Association Rules

  • The Apriori algorithm for association rule learning
  • Measuring rule relevance through support and confidence
  • Constructing rule sets using the Apriori principle

Additional Topics

  • Spark, PySpark, MLlib, and Multi-armed Bandits

Requirements

Proficiency in Python

Testimonials (7)

Related Categories