Hierarchical clustering (linkage) in SciPy - Time & Space Complexity

Time Complexity: Hierarchical clustering (linkage)

O(n³)

Understanding Time Complexity

When using hierarchical clustering with linkage, it is important to know how the time needed grows as the data size increases.

We want to understand how the clustering steps scale with more data points.

Scenario Under Consideration

Analyze the time complexity of the following scipy code snippet.

from scipy.cluster.hierarchy import linkage
import numpy as np

# Generate random data points
X = np.random.rand(100, 2)

# Perform hierarchical clustering using linkage
Z = linkage(X, method='ward')
    

This code creates 100 points and groups them step-by-step using the Ward method.

Identify Repeating Operations

Look at what repeats as the algorithm runs.

• Primary operation: Finding the closest pair of clusters to merge.
• How many times: This happens once for each merge, so about n-1 times for n points.

How Execution Grows With Input

As the number of points grows, the work to find closest clusters grows quickly.

Input Size (n)	Approx. Operations
10	~100
100	~10,000
1000	~1,000,000

Pattern observation: The operations grow roughly with the square of the input size.

Final Time Complexity

Time Complexity: O(n³)

This means if you double the number of points, the time needed roughly increases by a factor of eight.

Common Mistake

[X] Wrong: "Hierarchical clustering runs quickly even on very large datasets because it just merges clusters step-by-step."

[OK] Correct: Each merge requires checking many pairs, so the total work grows fast as data grows.

Interview Connect

Understanding how clustering time grows helps you explain choices in data analysis and shows you can think about algorithm efficiency clearly.

Self-Check

"What if we used a faster method to find closest clusters at each step? How would the time complexity change?"

Practice

1. What does the linkage function in scipy.cluster.hierarchy do in hierarchical clustering?

easy

A. It calculates distances between clusters step-by-step to form a hierarchy.

B. It assigns data points to fixed clusters before clustering.

C. It visualizes the final clusters using a scatter plot.

D. It normalizes the data before clustering.

Solution

1. Step 1: Understand hierarchical clustering process

   Hierarchical clustering builds clusters step-by-step by merging closest groups.

2. Step 2: Role of linkage function

   The linkage function calculates distances between clusters at each step to decide which to merge next.

3. Final Answer:

   It calculates distances between clusters step-by-step to form a hierarchy. -> Option A

4. Quick Check:

   Linkage = stepwise cluster distance calculation [OK]

Hint: Linkage = stepwise cluster distance calculation [OK]

Common Mistakes:

• Thinking linkage assigns fixed clusters first
• Confusing linkage with visualization functions
• Assuming linkage normalizes data

2. Which of the following is the correct way to import the linkage function from scipy.cluster.hierarchy?

easy

A. from scipy.cluster import linkage

B. import linkage from scipy.cluster.hierarchy

C. import linkage from scipy.cluster

D. from scipy.cluster.hierarchy import linkage

Solution

1. Step 1: Identify correct module path

   The linkage function is inside the hierarchy submodule of scipy.cluster.

2. Step 2: Use correct Python import syntax

   Python import syntax for functions is from module import function. So, from scipy.cluster.hierarchy import linkage is correct.

3. Final Answer:

   from scipy.cluster.hierarchy import linkage -> Option D

4. Quick Check:

   Correct import = from scipy.cluster.hierarchy import linkage [OK]

Hint: Use 'from scipy.cluster.hierarchy import linkage' [OK]

Common Mistakes:

• Using wrong module path
• Wrong import syntax like 'import linkage from ...'
• Importing from scipy.cluster directly

3. What is the output of this code snippet?

from scipy.cluster.hierarchy import linkage
import numpy as np

X = np.array([[1, 2], [3, 4], [5, 6]])
Z = linkage(X, method='single')
print(Z.shape)

medium

A. (2, 3)

B. (3, 4)

C. (2, 4)

D. (3, 3)

Solution

1. Step 1: Understand linkage output shape

   For n data points, linkage returns a matrix with n-1 rows and 4 columns.

2. Step 2: Calculate shape for 3 points

   Here, n=3, so output shape is (2, 4).

3. Final Answer:

   (2, 4) -> Option C

4. Quick Check:

   Linkage shape = (n-1, 4) = (2, 4) [OK]

Hint: Linkage output shape = (n-1, 4) for n points [OK]

Common Mistakes:

• Expecting shape (n, 4) instead of (n-1, 4)
• Confusing columns count
• Miscounting number of data points

4. Identify the error in this code snippet:

from scipy.cluster.hierarchy import linkage
import numpy as np

X = np.array([[1, 2], [3, 4], [5, 6]])
Z = linkage(X, method='fast')
print(Z)

medium

A. The method 'fast' is not a valid linkage method.

B. The input array X must be 1-dimensional.

C. The linkage function requires a distance matrix, not raw data.

D. The print statement is missing parentheses.

Solution

1. Step 1: Check valid linkage methods

   Valid methods include 'single', 'complete', 'average', 'ward', etc. 'fast' is not valid.

2. Step 2: Confirm input data and syntax

   Input can be raw data array; print statement syntax is correct in Python 3.

3. Final Answer:

   The method 'fast' is not a valid linkage method. -> Option A

4. Quick Check:

   Invalid method name causes error [OK]

Hint: Check method names carefully; 'fast' is invalid [OK]

Common Mistakes:

• Assuming 'fast' is a valid method
• Thinking input must be 1D array
• Confusing linkage input requirements

5. You have a dataset with 5 points and want to perform hierarchical clustering using the 'ward' method. After computing linkage, how many merges will be recorded in the linkage matrix, and why?

hard

A. 3 merges, because only the closest points are merged.

B. 4 merges, because each merge reduces clusters by one until one cluster remains.

C. 6 merges, because the 'ward' method adds an extra merge step.

D. 5 merges, because there are 5 points to merge individually.

Solution

1. Step 1: Understand merges in hierarchical clustering

   For n points, hierarchical clustering performs n-1 merges to combine all points into one cluster.

2. Step 2: Apply to 5 points with 'ward' method

   With 5 points, the linkage matrix records 4 merges regardless of method.

3. Final Answer:

   4 merges, because each merge reduces clusters by one until one cluster remains. -> Option B

4. Quick Check:

   Merges = n-1 = 4 for 5 points [OK]

Hint: Number of merges = number of points minus one [OK]

Common Mistakes:

• Thinking merges equal number of points
• Assuming method changes merge count
• Confusing merges with cluster count