Distance matrix computation in SciPy - Interactive Code Practice

Practice - 5 Tasks

1fill in blank

easy

Complete the code to import the function that computes pairwise distances.

SciPy

from scipy.spatial.distance import [1]

Drag options to blanks, or click blank then click option'

Aeuclidean

Bcdist

Cpdist

Dsquareform

Attempts:

3 left

💡 Hint

Common Mistakes

Choosing cdist which is for distances between two different sets.

Choosing squareform which converts distance vectors to matrices.

The pdist function computes pairwise distances between points in a single set.

2fill in blank

medium

Complete the code to compute the pairwise Euclidean distances of points in array X.

SciPy

distances = [1](X, metric='euclidean')

Drag options to blanks, or click blank then click option'

Apdist

Bcdist

Csquareform

Deuclidean

Attempts:

3 left

💡 Hint

Common Mistakes

Using cdist with only one array causes an error.

Using squareform directly on the data instead of on distances.

pdist computes pairwise distances within one set of points.

3fill in blank

hard

Fix the error in the code to convert the condensed distance vector d to a square matrix.

SciPy

distance_matrix = [1](d)

Drag options to blanks, or click blank then click option'

Asquareform

Bcdist

Ceuclidean

Dpdist

Attempts:

3 left

💡 Hint

Common Mistakes

Using pdist or cdist which expect raw data, not condensed distances.

Using euclidean which is a metric, not a function to convert formats.

squareform converts condensed distance vectors to square matrices.

4fill in blank

hard

Fill both blanks to compute the distance matrix between two different sets X and Y using the cosine metric.

SciPy

dist_matrix = [1](X, [2], metric='cosine')

Drag options to blanks, or click blank then click option'

Acdist

Bpdist

CY

DX

Attempts:

3 left

💡 Hint

Common Mistakes

Using pdist which only takes one array.

Passing X as the second argument instead of Y.

cdist computes distances between two sets; the second argument must be the other set Y.

5fill in blank

hard

Fill all three blanks to create a dictionary mapping each point's index to its Euclidean distance from the origin (0,0).

SciPy

origin = [0, 0]
distances = {i: [1](point, [2]) for i, point in enumerate(X)}
sorted_distances = sorted(distances.items(), key=lambda x: x[[3]])

Drag options to blanks, or click blank then click option'

Acdist

Borigin

C1

Deuclidean

Attempts:

3 left

💡 Hint

Common Mistakes

Using cdist which requires arrays, not single points.

Sorting by x[0] which sorts by index, not distance.

Use euclidean metric to compute distance from origin. Sorting by x[1] sorts by distance values.

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