In this exercise, you will implement the anomaly detection algorithm and apply it to detect failing servers on a network.
First, let’s run the cell below to import all the packages that you will need during this assignment.
utils.py
contains helper functions for this assignment. You do not need to modify code in this file.import numpy as np
import matplotlib.pyplot as plt
from utils import *
%matplotlib inline
In this exercise, you will implement an anomaly detection algorithm to detect anomalous behavior in server computers.
The dataset contains two features -
While your servers were operating, you collected $m=307$ examples of how they were behaving, and thus have an unlabeled dataset ${x^{(1)}, \ldots, x^{(m)}}$.
You will use a Gaussian model to detect anomalous examples in your dataset.
You will start by loading the dataset for this task.
load_data()
function shown below loads the data into the variables X_train
, X_val
and y_val
X_train
to fit a Gaussian distributionX_val
and y_val
as a cross validation set to select a threshold and determine anomalous vs normal examples# Load the dataset
X_train, X_val, y_val = load_data()
Let’s get more familiar with your dataset.
The code below prints the first five elements of each of the variables
# Display the first five elements of X_train
print("The first 5 elements of X_train are:\n", X_train[:5])
The first 5 elements of X_train are:
[[13.04681517 14.74115241]
[13.40852019 13.7632696 ]
[14.19591481 15.85318113]
[14.91470077 16.17425987]
[13.57669961 14.04284944]]
# Display the first five elements of X_val
print("The first 5 elements of X_val are\n", X_val[:5])
The first 5 elements of X_val are
[[15.79025979 14.9210243 ]
[13.63961877 15.32995521]
[14.86589943 16.47386514]
[13.58467605 13.98930611]
[13.46404167 15.63533011]]
# Display the first five elements of y_val
print("The first 5 elements of y_val are\n", y_val[:5])
The first 5 elements of y_val are
[0 0 0 0 0]
Another useful way to get familiar with your data is to view its dimensions.
The code below prints the shape of X_train
, X_val
and y_val
.
print ('The shape of X_train is:', X_train.shape)
print ('The shape of X_val is:', X_val.shape)
print ('The shape of y_val is: ', y_val.shape)
The shape of X_train is: (307, 2)
The shape of X_val is: (307, 2)
The shape of y_val is: (307,)
Before starting on any task, it is often useful to understand the data by visualizing it.
For this dataset, you can use a scatter plot to visualize the data (X_train
), since it has only two properties to plot (throughput and latency)
Your plot should look similar to the one below
# Create a scatter plot of the data. To change the markers to blue "x",
# we used the 'marker' and 'c' parameters
plt.scatter(X_train[:, 0], X_train[:, 1], marker='x', c='b')
# Set the title
plt.title("The first dataset")
# Set the y-axis label
plt.ylabel('Throughput (mb/s)')
# Set the x-axis label
plt.xlabel('Latency (ms)')
# Set axis range
plt.axis([0, 30, 0, 30])
plt.show()
To perform anomaly detection, you will first need to fit a model to the data’s distribution.
Given a training set ${x^{(1)}, …, x^{(m)}}$ you want to estimate the Gaussian distribution for each of the features $x_i$.
Recall that the Gaussian distribution is given by
$$ p(x ; \mu,\sigma ^2) = \frac{1}{\sqrt{2 \pi \sigma ^2}}\exp^{ - \frac{(x - \mu)^2}{2 \sigma ^2} }$$
where $\mu$ is the mean and $\sigma^2$ is the variance.
For each feature $i = 1\ldots n$, you need to find parameters $\mu_i$ and $\sigma_i^2$ that fit the data in the $i$-th dimension ${x_i^{(1)}, …, x_i^{(m)}}$ (the $i$-th dimension of each example).
Implementation:
Your task is to complete the code in estimate_gaussian
below.
Please complete the estimate_gaussian
function below to calculate mu
(mean for each feature in X
) and var
(variance for each feature in X
).
You can estimate the parameters, ($\mu_i$, $\sigma_i^2$), of the $i$-th feature by using the following equations. To estimate the mean, you will use:
$$\mu_i = \frac{1}{m} \sum_{j=1}^m x_i^{(j)}$$
and for the variance you will use: $$\sigma_i^2 = \frac{1}{m} \sum_{j=1}^m (x_i^{(j)} - \mu_i)^2$$
If you get stuck, you can check out the hints presented after the cell below to help you with the implementation.
# UNQ_C1
# GRADED FUNCTION: estimate_gaussian
def estimate_gaussian(X):
"""
Calculates mean and variance of all features
in the dataset
Args:
X (ndarray): (m, n) Data matrix
Returns:
mu (ndarray): (n,) Mean of all features
var (ndarray): (n,) Variance of all features
"""
m, n = X.shape
### START CODE HERE ###
mu = np.mean(X, axis = 0)
var = np.var(X, axis = 0)
### END CODE HERE ###
return mu, var
You can implement this function in two ways:
X
(each feature) and then looping over each data point.np.sum()
with axis = 0
parameter (since we want the sum for each column)Here’s how you can structure the overall implementation of this function for the vectorized implementation:
def estimate_gaussian(X):
m, n = X.shape
### START CODE HERE ###
mu = # Your code here to calculate the mean of every feature
var = # Your code here to calculate the variance of every feature
### END CODE HERE ###
return mu, var
```
If you're still stuck, you can check the hints presented below to figure out how to calculate `mu` and `var`.
<details>
<summary><font size="2" color="darkblue"><b>Hint to calculate mu</b></font></summary>
    You can use <a href="https://numpy.org/doc/stable/reference/generated/numpy.sum.html">np.sum</a> to with `axis = 0` parameter to get the sum for each column of an array
<details>
<summary><font size="2" color="blue"><b>    More hints to calculate mu</b></font></summary>
    You can compute mu as <code>mu = 1 / m * np.sum(X, axis = 0)</code>
</details>
</details>
<details>
<summary><font size="2" color="darkblue"><b>Hint to calculate var</b></font></summary>
    You can use <a href="https://numpy.org/doc/stable/reference/generated/numpy.sum.html">np.sum</a> to with `axis = 0` parameter to get the sum for each column of an array and <code>**2</code> to get the square.
<details>
<summary><font size="2" color="blue"><b>    More hints to calculate var</b></font></summary>
    You can compute var as <code> var = 1 / m * np.sum((X - mu) ** 2, axis = 0)</code>
</details>
</details>
You can check if your implementation is correct by running the following test code:
# Estimate mean and variance of each feature
mu, var = estimate_gaussian(X_train)
print("Mean of each feature:", mu)
print("Variance of each feature:", var)
# UNIT TEST
from public_tests import *
estimate_gaussian_test(estimate_gaussian)
Mean of each feature: [14.11222578 14.99771051]
Variance of each feature: [1.83263141 1.70974533]
[92mAll tests passed!
Expected Output:
Mean of each feature: | [14.11222578 14.99771051] |
Variance of each feature: | [1.83263141 1.70974533] |
Now that you have completed the code in estimate_gaussian
, we will visualize the contours of the fitted Gaussian distribution.
You should get a plot similar to the figure below.
From your plot you can see that most of the examples are in the region with the highest probability, while the anomalous examples are in the regions with lower probabilities.
# Returns the density of the multivariate normal
# at each data point (row) of X_train
p = multivariate_gaussian(X_train, mu, var)
#Plotting code
visualize_fit(X_train, mu, var)
Now that you have estimated the Gaussian parameters, you can investigate which examples have a very high probability given this distribution and which examples have a very low probability.
In this section, you will complete the code in select_threshold
to select the threshold $\varepsilon$ using the $F_1$ score on a cross validation set.
select_threshold
in the vector p_val
.y_val
.Please complete the select_threshold
function below to find the best threshold to use for selecting outliers based on the results from the validation set (p_val
) and the ground truth (y_val
).
In the provided code select_threshold
, there is already a loop that will try many different values of $\varepsilon$ and select the best $\varepsilon$ based on the $F_1$ score.
You need to implement code to calculate the F1 score from choosing epsilon
as the threshold and place the value in F1
.
Recall that if an example $x$ has a low probability $p(x) < \varepsilon$, then it is classified as an anomaly.
Then, you can compute precision and recall by: $$\begin{aligned} prec&=&\frac{tp}{tp+fp}\ rec&=&\frac{tp}{tp+fn}, \end{aligned}$$ where
The $F_1$ score is computed using precision ($prec$) and recall ($rec$) as follows: $$F_1 = \frac{2\cdot prec \cdot rec}{prec + rec}$$
Implementation Note: In order to compute $tp$, $fp$ and $fn$, you may be able to use a vectorized implementation rather than loop over all the examples.
If you get stuck, you can check out the hints presented after the cell below to help you with the implementation.
# UNQ_C2
# GRADED FUNCTION: select_threshold
def select_threshold(y_val, p_val):
"""
Finds the best threshold to use for selecting outliers
based on the results from a validation set (p_val)
and the ground truth (y_val)
Args:
y_val (ndarray): Ground truth on validation set
p_val (ndarray): Results on validation set
Returns:
epsilon (float): Threshold chosen
F1 (float): F1 score by choosing epsilon as threshold
"""
best_epsilon = 0
best_F1 = 0
F1 = 0
step_size = (max(p_val) - min(p_val)) / 1000
for epsilon in np.arange(min(p_val), max(p_val), step_size):
### START CODE HERE ###
p_anomaly = (p_val < epsilon).astype(np.int64)
true_pos = np.sum((p_anomaly == 1) & (y_val == 1))
false_pos = np.sum((p_anomaly == 1) & (y_val == 0))
false_neg = np.sum((p_anomaly == 0) & (y_val == 1))
prec = true_pos / (true_pos + false_pos)
rec = true_pos / (true_pos + false_neg)
F1 = (2 * prec * rec) / (prec + rec)
### END CODE HERE ###
if F1 > best_F1:
best_F1 = F1
best_epsilon = epsilon
return best_epsilon, best_F1
def select_threshold(y_val, p_val):
best_epsilon = 0
best_F1 = 0
F1 = 0
step_size = (max(p_val) - min(p_val)) / 1000
for epsilon in np.arange(min(p_val), max(p_val), step_size):
### START CODE HERE ###
predictions = # Your code here to calculate predictions for each example using epsilon as threshold
tp = # Your code here to calculate number of true positives
fp = # Your code here to calculate number of false positives
fn = # Your code here to calculate number of false negatives
prec = # Your code here to calculate precision
rec = # Your code here to calculate recall
F1 = # Your code here to calculate F1
### END CODE HERE ###
if F1 > best_F1:
best_F1 = F1
best_epsilon = epsilon
return best_epsilon, best_F1
```
If you're still stuck, you can check the hints presented below to figure out how to calculate each variable.
<details>
<summary><font size="2" color="darkblue"><b>Hint to calculate predictions</b></font></summary>
    If an example 𝑥 has a low probability $p(x) < \epsilon$ , then it is classified as an anomaly. To get predictions for each example (0/ False for normal and 1/True for anomaly), you can use <code>predictions = (p_val < epsilon)</code>
</details>
<details>
<summary><font size="2" color="darkblue"><b>Hint to calculate tp, fp, fn</b></font></summary>
   
<ul>
<li>If you have several binary values in an $n$-dimensional
binary vector, you can find out how many values in this vector are 0 by using: np.sum(v == 0)
predictions
is a binary vector of the size of your number of cross validation set, where the $i$-th element is 1 if your algorithm considers $x_{\rm cv}^{(i)}$ an anomaly, and 0 otherwise. fp = sum((predictions == 1) & (y_val == 0))
. tp = np.sum((predictions == 1) & (y_val == 1))
fn = np.sum((predictions == 0) & (y_val == 1))
<details>
<summary><font size="2" color="darkblue"><b>Hint to calculate precision</b></font></summary>
    You can calculate precision as <code>prec = tp / (tp + fp)</code>
</details>
<details>
<summary><font size="2" color="darkblue"><b>Hint to calculate recall</b></font></summary>
    You can calculate recall as <code>rec = tp / (tp + fn)</code>
</details>
<details>
<summary><font size="2" color="darkblue"><b>Hint to calculate F1</b></font></summary>
    You can calculate F1 as <code>F1 = 2 * prec * rec / (prec + rec)</code>
</details>
You can check your implementation using the code below
p_val = multivariate_gaussian(X_val, mu, var)
epsilon, F1 = select_threshold(y_val, p_val)
print('Best epsilon found using cross-validation: %e' % epsilon)
print('Best F1 on Cross Validation Set: %f' % F1)
# UNIT TEST
select_threshold_test(select_threshold)
Best epsilon found using cross-validation: 8.990853e-05
Best F1 on Cross Validation Set: 0.875000
[92mAll tests passed!
Expected Output:
Best epsilon found using cross-validation: | 8.99e-05 |
Best F1 on Cross Validation Set: | 0.875 |
Now we will run your anomaly detection code and circle the anomalies in the plot (Figure 3 below).
# Find the outliers in the training set
outliers = p < epsilon
# Visualize the fit
visualize_fit(X_train, mu, var)
# Draw a red circle around those outliers
plt.plot(X_train[outliers, 0], X_train[outliers, 1], 'ro',
markersize= 10,markerfacecolor='none', markeredgewidth=2)
[<matplotlib.lines.Line2D at 0x7ff0b4320b10>]
Now, we will run the anomaly detection algorithm that you implemented on a more realistic and much harder dataset.
In this dataset, each example is described by 11 features, capturing many more properties of your compute servers.
Let’s start by loading the dataset.
load_data()
function shown below loads the data into variables X_train_high
, X_val_high
and y_val_high
_high
is meant to distinguish these variables from the ones used in the previous partX_train_high
to fit Gaussian distributionX_val_high
and y_val_high
as a cross validation set to select a threshold and determine anomalous vs normal examples# load the dataset
X_train_high, X_val_high, y_val_high = load_data_multi()
Let’s check the dimensions of these new variables to become familiar with the data
print ('The shape of X_train_high is:', X_train_high.shape)
print ('The shape of X_val_high is:', X_val_high.shape)
print ('The shape of y_val_high is: ', y_val_high.shape)
The shape of X_train_high is: (1000, 11)
The shape of X_val_high is: (100, 11)
The shape of y_val_high is: (100,)
Now, let’s run the anomaly detection algorithm on this new dataset.
The code below will use your code to
X_train_high
from which you estimated the Gaussian parameters, as well as for the the cross-validation set X_val_high
.select_threshold
to find the best threshold $\varepsilon$.# Apply the same steps to the larger dataset
# Estimate the Gaussian parameters
mu_high, var_high = estimate_gaussian(X_train_high)
# Evaluate the probabilites for the training set
p_high = multivariate_gaussian(X_train_high, mu_high, var_high)
# Evaluate the probabilites for the cross validation set
p_val_high = multivariate_gaussian(X_val_high, mu_high, var_high)
# Find the best threshold
epsilon_high, F1_high = select_threshold(y_val_high, p_val_high)
print('Best epsilon found using cross-validation: %e'% epsilon_high)
print('Best F1 on Cross Validation Set: %f'% F1_high)
print('# Anomalies found: %d'% sum(p_high < epsilon_high))
Best epsilon found using cross-validation: 1.377229e-18
Best F1 on Cross Validation Set: 0.615385
# Anomalies found: 117
Expected Output:
Best epsilon found using cross-validation: | 1.38e-18 |
Best F1 on Cross Validation Set: | 0.615385 |
# anomalies found: | 117 |