Get in Touch
 Duration 21 hours

Course Outline

Introduction

This module offers a foundational overview of when to apply 'machine learning,' key considerations, and its implications, including advantages and disadvantages. It addresses data types (structured/unstructured/static/streamed), data validity and volume, the distinction between data-driven and user-driven analytics, and the comparison between statistical and machine learning models. It also covers the challenges of unsupervised learning, the bias-variance trade-off, iteration/evaluation, cross-validation strategies, and the categories of supervised/unsupervised/reinforcement learning.

MAJOR TOPICS

1. Naive Bayes fundamentals

  • Core concepts of Bayesian methods
  • Probability theory
  • Joint probability
  • Conditional probability and Bayes' theorem
  • The Naive Bayes algorithm
  • Naive Bayes classification
  • The Laplace estimator
  • Incorporating numeric features into Naive Bayes

2. Decision Trees explained

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

3. Neural Networks insights

  • Transitioning from biological to artificial neurons
  • Activation functions
  • Network architecture
  • Determining the number of layers
  • Information flow direction
  • Node count per layer
  • Training neural networks via backpropagation
  • Deep Learning principles

4. Support Vector Machines (SVM) overview

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

5. Clustering techniques

  • 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. Assessing classification performance

  • Processing classification prediction data
  • In-depth analysis of confusion matrices
  • Using 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 standard models for superior performance

  • Leveraging caret for automatic parameter tuning
  • Developing a basic tuned model
  • Refining the tuning process
  • Enhancing model performance through meta-learning
  • Concepts of ensembles
  • Bagging techniques
  • Boosting techniques
  • Random forests
  • Training random forests
  • Evaluating random forest performance

MINOR TOPICS

8. Nearest neighbors for classification

  • The kNN algorithm
  • Distance calculation
  • Selecting an appropriate k
  • 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 analysis

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

11. Regression and model trees

  • Integrating regression into tree structures

12. Association rules

  • The Apriori algorithm for association rule learning
  • Measuring rule significance via support and confidence
  • Constructing rule sets using the Apriori principle

Additional Elements

  • Spark/PySpark/MLlib and Multi-armed bandits

Requirements

Python proficiency

Number of participants


Price per participant

Testimonials (7)

Upcoming Courses

Related Categories