Get in Touch
 Duration 21 hours

Course Outline

Introduction

This section offers a general overview of when to apply 'machine learning', the factors to consider, and its broader implications, including benefits and drawbacks. 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 methods, 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 via Bayes' theorem
  • The naive Bayes algorithm
  • Classification using naive Bayes
  • The Laplace estimator
  • Handling numeric features with naive Bayes

2. Grasping decision trees

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

3. Grasping neural networks

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

4. Grasping Support Vector Machines

  • Classification using hyperplanes
  • Identifying the maximum margin
  • Scenarios with linearly separable data
  • Scenarios with non-linearly separable data
  • Employing kernels for non-linear spaces

5. Grasping clustering

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

6. Assessing classification performance

  • Processing classification prediction data
  • In-depth analysis of confusion matrices
  • Evaluating performance via confusion matrices
  • Metrics beyond accuracy
  • The kappa statistic
  • Sensitivity and specificity
  • Precision and recall
  • The F-measure
  • Visualizing performance compromises
  • ROC curves
  • Predicting future performance
  • The holdout method
  • Cross-validation
  • Bootstrap sampling

7. Optimizing standard models for improved performance

  • Utilizing caret for automated parameter tuning
  • Developing a basic tuned model
  • Customizing the tuning workflow
  • Enhancing model results via meta-learning
  • Comprehending ensembles
  • Bagging
  • Boosting
  • Random forests
  • Training random forests
  • Assessing random forest performance

MINOR TOPICS

8. Grasping classification via nearest neighbors

  • The kNN algorithm
  • Distance calculation
  • Selecting an appropriate k value
  • Data preparation for kNN implementation
  • Why the kNN algorithm is considered lazy?

9. Grasping classification rules

  • The separate and conquer technique
  • The One Rule algorithm
  • The RIPPER algorithm
  • Extracting 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

  • Integrating regression into trees

12. Grasping association rules

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

Extras

  • Spark/PySpark/MLlib and Multi-armed bandits

Requirements

Proficiency in Python

Number of participants


Price per participant

Testimonials (7)

Upcoming Courses

Related Categories