Get in Touch
 Duration 21 hours

Course Outline

Introduction

This section offers a broad overview of when to apply 'machine learning', key considerations, and its implications, including advantages and disadvantages. It explores 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.

KEY TOPICS

1. Exploring Naive Bayes

  • Fundamentals of Bayesian methods
  • Probability
  • Joint probability
  • Conditional probability using Bayes' theorem
  • The Naive Bayes algorithm
  • Naive Bayes classification
  • The Laplace estimator
  • Applying numeric features in Naive Bayes

2. Exploring Decision Trees

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

3. Exploring Neural Networks

  • Transitioning from biological to artificial neurons
  • Activation functions
  • Network topology
  • Determining the number of layers
  • Direction of information flow
  • Number of nodes per layer
  • Training neural networks via backpropagation
  • Deep Learning

4. Exploring Support Vector Machines

  • Classification using hyperplanes
  • Determining the maximum margin
  • Handling linearly separable data
  • Handling non-linearly separable data
  • Utilizing kernels for non-linear spaces

5. Exploring Clustering

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

6. Assessing Classification Performance

  • Handling classification prediction data
  • In-depth analysis of confusion matrices
  • Using 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
  • Predicting future performance
  • The holdout method
  • Cross-validation
  • Bootstrap sampling

7. Optimising Standard Models for Enhanced Performance

  • Automated parameter tuning with caret
  • Constructing a simple tuned model
  • Customising the tuning process
  • Boosting model performance through meta-learning
  • Understanding ensembles
  • Bagging
  • Boosting
  • Random forests
  • Training random forests
  • Assessing random forest performance

SECONDARY TOPICS

8. Classification via Nearest Neighbours

  • The kNN algorithm
  • Calculating distance
  • Selecting an appropriate k
  • Data preparation for kNN
  • Why the kNN algorithm is considered lazy

9. Understanding Classification Rules

  • 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
  • Correlations
  • Multiple linear regression

11. Regression and Model Trees

  • Incorporating regression into trees

12. Association Rules

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

Additional Modules

  • Spark/PySpark/MLlib and Multi-armed bandits

Requirements

Python proficiency

Testimonials (7)

Related Categories