Get in Touch

Course Outline

Introduction

This section offers a comprehensive overview of when to apply 'machine learning', the factors to consider, and the underlying concepts, including advantages and disadvantages. It covers data types (structured/unstructured/static/streamed), data validity and volume, data-driven versus user-driven analytics, statistical models compared to machine learning models, challenges in unsupervised learning, the bias-variance trade-off, iteration and evaluation, cross-validation strategies, and the distinctions between supervised, unsupervised, and reinforcement learning.

MAJOR TOPICS

1. Grasping Naive Bayes

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

2. Grasping Decision Trees

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

3. Grasping Neural Networks

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

4. Grasping 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. Grasping Clustering

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

6. Evaluating Classification Performance

  • Working with classification prediction data
  • In-depth analysis of confusion matrices
  • Using confusion matrices to assess performance
  • Beyond accuracy – alternative performance metrics
  • 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

  • Using caret for automated parameter tuning
  • Developing a simple tuned model
  • Customizing the tuning process
  • Improving model performance through meta-learning
  • Understanding ensembles
  • Bagging
  • Boosting
  • Random forests
  • Training random forests
  • Evaluating random forest performance

MINOR TOPICS

8. Grasping Classification via Nearest Neighbors

  • The kNN algorithm
  • Calculating distance
  • Selecting an appropriate k
  • Preparing data for kNN application
  • Why is the kNN algorithm considered lazy?

9. Grasping Classification Rules

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

10. Grasping Regression

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

11. Grasping Regression Trees and Model Trees

  • Incorporating regression into trees

12. Grasping Association Rules

  • The Apriori algorithm for association rule learning
  • Measuring rule interest – support and confidence
  • Constructing a set of rules using the Apriori principle

Extras

  • Spark/PySpark/MLlib and Multi-armed bandits

Requirements

Knowledge of Python

 21 Hours

Number of participants


Price per participant

Testimonials (7)

Upcoming Courses

Related Categories