Distance-based Models: Overview of Distance-based Metrics & Algorithms

Math    |    Intermediate
  • 9 Videos | 1h 9m 30s
  • Includes Assessment
  • Earns a Badge
Machine learning (ML) is widely used across all industries, meaning engineers need to be confident in using it. Pre-built libraries are available to start using ML with little knowledge. However, to get the most out of ML, it's worth taking the time to learn the math behind it. Use this course to learn how distances are measured in ML. Investigate the types of ML problems distance-based models can solve. Examine different distance measures, such as Euclidean, Manhattan, and Cosine. Learn how the distance-based ML algorithms K Nearest Neighbors (KNN) and K-means work. Lastly, use Python libraries and various metrics to compute the distance between a pair of points. Upon completion, you'll have a solid foundational knowledge of the mechanisms behind distance-based machine learning algorithms.

WHAT YOU WILL LEARN

  • discover the key concepts covered in this course
    recall how distance-based models work at a high level and identify the use cases of such models
    describe the Hamming and Cosine distance metrics
    recount how the KNN and K-means algorithms use distance metrics to perform ML operations
    define and visualize two points in a two-dimensional space using Python
  • calculate the Euclidean and Manhattan distance between two points using SciPy as well as your own function
    implement a Minkowski and Hamming distance calculator and use the built-in ones available in SciPy
    compute the cosine distance between vectors
    summarize the key concepts covered in this course

IN THIS COURSE

  • Playable
    1. 
    Course Overview
    2m 25s
    UP NEXT
  • Playable
    2. 
    How Distance-based Models Work
    8m 27s
  • Locked
    3. 
    Specialized Distance Metrics
    6m 37s
    FREE ACCESS
  • Locked
    4. 
    Algorithms Based on Distance Metrics
    11m 18s
    FREE ACCESS
  • Locked
    5. 
    Plotting Points in Two Dimensions
    11m 9s
    FREE ACCESS
  • Locked
    6. 
    Computing Euclidean and Manhattan Distances
    12m 40s
    FREE ACCESS
  • Locked
    7. 
    Calculating Minkowski and Hamming Distances
    9m 1s
    FREE ACCESS
  • Locked
    8. 
    Measuring Cosine Distances
    6m 1s
    FREE ACCESS
  • Locked
    9. 
    Course Summary
    1m 52s
    FREE ACCESS

EARN A DIGITAL BADGE WHEN YOU COMPLETE THIS COURSE

Skillsoft is providing you the opportunity to earn a digital badge upon successful completion of this course, which can be shared on any social network or business platform

Digital badges are yours to keep, forever.

YOU MIGHT ALSO LIKE

COURSE Math & Optimizations: Introducing Graphs & Graph Operations
BOOK Graph-Powered Machine Learning
COURSE Distance-based Models: Implementing Distance-based Algorithms