Get in Touch
 Duration 21 hours

Course Outline

Introduction

This section offers a broad overview of when to employ 'machine learning,' outlining key considerations, benefits, and drawbacks. It explores data types (structured/unstructured/static/streamed), data integrity and volume, the distinction between data-driven and user-driven analytics, and comparisons between statistical and machine learning models. It also addresses unsupervised learning challenges, the bias-variance trade-off, iteration and evaluation, cross-validation strategies, and the concepts of supervised, unsupervised, and reinforcement learning.

KEY TOPICS

1. Mastering Naive Bayes

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

2. Mastering Decision Trees

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

3. Mastering Neural Networks

  • Transition from biological to artificial neurons
  • Activation functions
  • Network topology
  • Layer count
  • Direction of information flow
  • Node count per layer
  • Training neural networks using backpropagation
  • Deep Learning

4. Mastering Support Vector Machines

  • Classification via hyperplanes
  • Identifying the maximum margin
  • Linearly separable data scenarios
  • Non-linearly separable data scenarios
  • Utilizing kernels for non-linear spaces

5. Mastering Clustering

  • Clustering as a machine learning objective
  • The k-means clustering algorithm
  • Using distance metrics for cluster assignment and updates
  • Determining the ideal number of clusters

6. Evaluating classification performance

  • Handling classification prediction data
  • In-depth analysis of confusion matrices
  • Utilizing confusion matrices for performance measurement
  • Performance metrics beyond accuracy
  • The kappa statistic
  • Sensitivity and specificity
  • Precision and recall
  • The F-measure
  • Visualizing performance trade-offs
  • ROC curves
  • Forecasting future performance
  • The holdout method
  • Cross-validation
  • Bootstrap sampling

7. Optimizing standard models for enhanced performance

  • Automated parameter tuning with caret
  • Building a basic tuned model
  • Customizing the tuning workflow
  • Enhancing model performance via meta-learning
  • Concepts of ensembles
  • Bagging
  • Boosting
  • Random forests
  • Training random forests
  • Assessing random forest performance

ADDITIONAL TOPICS

8. Classification via Nearest Neighbors

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

9. Classification rules

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

10. Regression

  • Simple linear regression
  • Ordinary least squares estimation
  • Correlations
  • Multiple linear regression

11. Regression trees and model trees

  • Incorporating regression into tree structures

12. Association rules

  • Association rule learning with the Apriori algorithm
  • Measuring rule interest via support and confidence
  • Constructing rule sets using the Apriori principle

Extras

  • Spark/PySpark/MLlib and Multi-armed bandits

Requirements

Knowledge of Python

Number of participants


Price per participant

Testimonials (7)

Upcoming Courses

Related Categories