Get in Touch

Course Outline

Introduction

This section offers a foundational overview of when to apply 'machine learning', key considerations, and its overall implications, 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 methods, and supervised, unsupervised, and reinforcement learning.

MAJOR TOPICS

1. Grasping Naive Bayes

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

2. Grasping Decision Trees

  • The divide-and-conquer approach
  • The C5.0 decision tree algorithm
  • Selecting optimal splits
  • Pruning decision trees

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 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 objective
  • The k-means clustering algorithm
  • Assigning and updating clusters based on distance
  • Selecting the optimal number of clusters

6. Evaluating Classification Performance

  • Handling classification prediction data
  • In-depth analysis of confusion matrices
  • Utilizing confusion matrices for performance measurement
  • 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 Pre-built Models for Enhanced Performance

  • Automated parameter tuning with caret
  • Building a simple tuned model
  • Tailoring the tuning process
  • Boosting model performance through meta-learning
  • Concepts of ensembles
  • Bagging
  • Boosting
  • Random forests
  • Training random forests
  • Assessing random forest performance

MINOR TOPICS

8. Classification via Nearest Neighbors

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

9. Classification Rules

  • The separate-and-conquer method
  • 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

  • Integrating regression into trees

12. Association Rules

  • The Apriori algorithm for association rule mining
  • Measuring rule interest: support and confidence
  • Constructing rule sets using the Apriori principle

Additional Topics

  • Spark/PySpark/MLlib and Multi-armed bandits

Requirements

Proficiency in Python

 21 Hours

Number of participants


Price per participant

Testimonials (7)

Upcoming Courses

Related Categories