Get in Touch
 Duration 21 hours

Course Outline

Introduction

This section offers a broad overview of when to apply 'machine learning,' outlining key considerations and implications, including its advantages and limitations. It explores datatypes (structured, unstructured, static, streamed), data validity and volume, the distinction between data-driven and user-driven analytics, comparisons between statistical models and machine learning models, the challenges of unsupervised learning, the bias-variance trade-off, iteration and evaluation, cross-validation methods, and the differences between supervised, unsupervised, and reinforcement learning.

MAJOR TOPICS

1. Grasping naive Bayes

  • Fundamental concepts of Bayesian methods
  • Probability theory
  • Joint probability
  • Conditional probability using Bayes' theorem
  • The naive Bayes algorithm
  • Naive Bayes classification
  • 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 optimal splits
  • 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 via backpropagation
  • Deep Learning

4. Grasping Support Vector Machines

  • Classification via hyperplanes
  • Identifying 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
  • Assigning and updating clusters using distance
  • Determining the optimal number of clusters

6. Assessing classification performance

  • Working with classification prediction data
  • Examining confusion matrices in detail
  • Utilizing 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
  • Estimating future performance
  • The holdout method
  • Cross-validation
  • Bootstrap sampling

7. Optimizing standard models for enhanced performance

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

MINOR TOPICS

8. Understanding classification via nearest neighbors

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

9. Understanding classification rules

  • The separate and conquer strategy
  • 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. Understanding regression trees and model trees

  • Incorporating regression into trees

12. Understanding association rules

  • The Apriori algorithm for association rule learning
  • Measuring rule significance via support and confidence
  • Generating a rule set 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