Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
Learn Challenge: Mahalanobis Distance in Practice | Section
Outlier and Novelty Detection
Section 1. Chapter 8
single

single

bookChallenge: Mahalanobis Distance in Practice

Swipe to show menu

Task

Swipe to start coding

You are given a small 2D dataset. Your goal is to compute the Mahalanobis distance of each observation from the data center and use it to detect outliers.

Steps:

  1. Compute the mean vector of the dataset.
  2. Compute the covariance matrix and its inverse.
  3. For each observation, compute Mahalanobis distance using the formula:
D(x)=(xμ)TΣ1(xμ)D(x) = \sqrt{(x - \mu)^T \Sigma^{-1} (x - \mu)}
  1. Store all distances in an array distances.
  2. Classify points as outliers if distance > threshold (use threshold = 2.5).
  3. Print both arrays (distances and outliers) for verification.

Use NumPy only.

Solution

Switch to desktopSwitch to desktop for real-world practiceContinue from where you are using one of the options below
Everything was clear?

How can we improve it?

Thanks for your feedback!

Section 1. Chapter 8
single

single

Ask AI

expand

Ask AI

ChatGPT

Ask anything or try one of the suggested questions to begin our chat

some-alt