Distance matrix computation in SciPy - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is a distance matrix in data science?

A distance matrix is a table that shows the distance between each pair of points in a dataset. It helps us understand how close or far points are from each other.

beginner

Which function in scipy computes the distance matrix between points?

The function scipy.spatial.distance_matrix computes the distance matrix between two sets of points.

beginner

How does the Euclidean distance between two points get calculated?

Euclidean distance is the straight-line distance between two points. It is calculated by taking the square root of the sum of squared differences of their coordinates.

beginner

What is the shape of the distance matrix if you have 5 points?

The distance matrix will be a 5x5 square matrix, where each cell shows the distance between two points.

intermediate

Why is computing a distance matrix useful in clustering?

It helps group points that are close together by showing how far apart each pair of points is. This is important for algorithms like k-means or hierarchical clustering.

Which scipy function is used to compute the distance matrix?

A scipy.spatial.distance_matrix

B scipy.linalg.inv

C scipy.optimize.minimize

D scipy.stats.norm

The function scipy.spatial.distance_matrix computes distances between points.

What does each element in a distance matrix represent?

A The difference between two points

B The sum of two points

C The product of two points

D The distance between two points

Each element shows the distance between a pair of points.

If you have 3 points, what will be the size of the distance matrix?

A 3x3

B 1x3

C 3x1

D 1x1

The distance matrix is square with size equal to the number of points.

Which distance metric does scipy.spatial.distance_matrix use by default?

A Cosine distance

B Manhattan distance

C Euclidean distance

D Hamming distance

It uses Euclidean distance by default.

Why might you want to compute a distance matrix before clustering?

A To sort points alphabetically

B To find how close points are to each other

C To calculate the average value of points

D To remove duplicate points

Distance matrices help identify groups of close points for clustering.

Explain what a distance matrix is and why it is useful in data science.

Think about how you measure distance between places on a map.

Describe how to compute a distance matrix using scipy and what the output looks like.

Imagine you have a list of points and want to know how far each is from the others.

Practice

1. What does the scipy.spatial.distance_matrix function compute?

easy

A. The average value of a list of numbers

B. The sum of all points in a dataset

C. The distances between all pairs of points in two sets

D. The maximum value in a dataset

Solution

1. Step 1: Understand the function purpose

   scipy.spatial.distance_matrix calculates distances between points, not sums or averages.

2. Step 2: Identify what is computed

   It returns a matrix showing distances between each point in one set to each point in another set.

3. Final Answer:

   The distances between all pairs of points in two sets -> Option C

4. Quick Check:

   Distance matrix = pairwise distances [OK]

Hint: Distance matrix = all pair distances between points [OK]

Common Mistakes:

• Confusing distance matrix with sum or average calculations
• Thinking it returns a single distance value
• Assuming it only works for one set of points

2. Which of the following is the correct way to import the distance_matrix function from scipy?

easy

A. import scipy.distance_matrix

B. import distance_matrix from scipy.spatial

C. from scipy import distance_matrix

D. from scipy.spatial import distance_matrix

Solution

1. Step 1: Recall correct import syntax

   Functions inside modules are imported using from module import function.

2. Step 2: Match with scipy structure

   distance_matrix is inside scipy.spatial, so correct import is from scipy.spatial import distance_matrix.

3. Final Answer:

   from scipy.spatial import distance_matrix -> Option D

4. Quick Check:

   Correct import syntax = from scipy.spatial import distance_matrix [OK]

Hint: Use 'from module import function' for specific imports [OK]

Common Mistakes:

• Using 'import scipy.distance_matrix' which is invalid
• Trying 'from scipy import distance_matrix' ignoring submodules
• Incorrect order like 'import distance_matrix from ...'

3. What is the output of this code?

import numpy as np
from scipy.spatial import distance_matrix
points1 = np.array([[0, 0], [1, 1]])
points2 = np.array([[1, 0], [2, 2]])
dm = distance_matrix(points1, points2)
print(dm)

medium

A. [[1. 2.82842712]
[1. 1.41421356]]

B. [[0. 1.41421356]
[1. 2.23606798]]

C. [[1.41421356 2.23606798]
[0. 1.41421356]]

D. [[1. 1.41421356]
[1.41421356 2.82842712]]

Solution

1. Step 1: Calculate distances from points1 to points2

   Distance between (0,0) and (1,0) is 1.0; between (0,0) and (2,2) is sqrt(4+4)=2.8284.

2. Step 2: Calculate distances for second point

   Distance between (1,1) and (1,0) is 1.0; between (1,1) and (2,2) is sqrt(1+1)=1.4142.

3. Final Answer:

   [[1. 2.82842712] [1. 1.41421356]] -> Option A

4. Quick Check:

   Distance matrix matches calculated values [OK]

Hint: Calculate Euclidean distances pairwise for matrix [OK]

Common Mistakes:

• Mixing order of points causing wrong matrix
• Using Manhattan distance instead of Euclidean
• Confusing rows and columns in output

4. Identify the error in this code snippet:

import numpy as np
from scipy.spatial import distance_matrix
points = np.array([[0, 0], [1, 1]])
dm = distance_matrix(points)
print(dm)

medium

A. distance_matrix cannot handle integer arrays

B. distance_matrix requires two arguments, but only one is given

C. numpy array must be 1D, but points is 2D

D. print statement syntax is incorrect

Solution

1. Step 1: Check function parameters

   distance_matrix needs two arrays of points to compute distances between them.

2. Step 2: Identify missing argument

   Only one argument points is passed, so it will raise a TypeError.

3. Final Answer:

   distance_matrix requires two arguments, but only one is given -> Option B

4. Quick Check:

   Missing second argument error [OK]

Hint: distance_matrix needs two point sets as input [OK]

Common Mistakes:

• Passing only one array instead of two
• Assuming it computes distances within one set automatically
• Ignoring function signature requirements

5. You have two sets of points:

pointsA = [[0, 0], [3, 4], [6, 8]]
pointsB = [[0, 0], [0, 5]]

You want to find which point in pointsA is closest to any point in pointsB. Which approach using scipy.spatial.distance_matrix is correct?

hard

A. Compute the distance matrix, then find the minimum distance in each row

B. Compute the distance matrix, then sum all distances and pick the smallest sum

C. Compute the distance matrix, then find the maximum distance in each column

D. Compute the distance matrix, then average all distances and pick the largest average

Solution

1. Step 1: Compute distance matrix between pointsA and pointsB

   This gives distances from each point in pointsA to each point in pointsB.

2. Step 2: Find minimum distance per point in pointsA

   For each row (point in pointsA), find the smallest distance to any point in pointsB to identify closest point.

3. Final Answer:

   Compute the distance matrix, then find the minimum distance in each row -> Option A

4. Quick Check:

   Closest point = min distance per row [OK]

Hint: Minimum distance per row shows closest point [OK]

Common Mistakes:

• Using sum or average instead of minimum distance
• Finding maximum distance which is farthest, not closest
• Confusing rows and columns in the matrix