What is Distance Matrix in Python?

Distance Matrix in Python is a symmetric square matrix representing pairwise distances between objects like data points or cities. Distance Matrix is computed using Euclidean distance with libraries like NumPy and SciPy.

Distance matrices play a vital role in various fields such as biology, data science, and machine learning. They are used to measure the dissimilarity or similarity between objects, making them a fundamental concept in many applications. In this blog post, we'll delve into the world of distance matrices in Python, exploring what they are, how to compute them, and where they find their utility.

distance matrix python, code, computer

What is a Distance Matrix?

A distance matrix is a symmetric square matrix that represents the pairwise distances between a set of objects in matrix data. These objects can be anything - data points, cities, biological sequences, or more. Each cell of the matrix stores the distance or dissimilarity value between two objects. The diagonal elements usually have a value of zero since an object is always at zero distance from itself.

The distance between two points can be calculated using a variety of distance functions, such as the Euclidean distance, the Manhattan distance, the Minkowski p norm distance, the correlation distance, and the cosine distance function. The choice of distance function depends on the specific application.

Computing Distance Matrix in Python

Python provides several libraries and functions to compute distance matrices efficiently. Let's explore some of the most common methods using popular libraries like NumPy and SciPy.

Distance Matrix Using NumPy

NumPy is a powerful library for numerical computing in Python. To compute a distance matrix, we can use the `numpy.linalg.norm` function to calculate the Euclidean distance between pairs of points in n dimensional space.

import numpy as np

# Sample data points
points = np.array([[1, 2], [3, 4], [5, 6]])

# Initialize an empty distance matrix
n = len(points)

distance_matrix = np.zeros((n, n))

# Calculate pairwise Euclidean distances
for i in range(n): # python loop
    for j in range(n):
        # Calculate the distance between two vectors u and v
        u = points[i]
        v = points[j]
        distance_matrix[i][j] = np.linalg.norm(u - v)



[[0	        2.82842712	5.65685425]
 [2.82842712   0	       2.82842712]
 [5.65685425	2.82842712    0]]

Distance Matrix Using SciPy

SciPy is another scientific library that extends the capabilities of NumPy. It offers a more efficient method for computing distance matrices using the `scipy.spatial.distance.cdist` function.

from scipy.spatial import distance

# Compute the distance matrix using cdist
distance_matrix = distance.cdist(points, points, 'euclidean')


[[0   2.82842712   5.65685425]
 [2.82842712   0   2.82842712]
 [5.65685425   2.82842712   0]]

Condensed Distance Matrix

A condensed distance matrix is a square matrix that only stores the upper triangle of the distance matrix. This can be useful when the distance metric is large and sparse, as it can save memory and computational resources.

Large Temporary Arrays

When computing distance matrices, it is important to be aware of the potential for large temporary arrays to be created. This is because the distance between two objects is often calculated by summing the squared differences between their corresponding elements. This can lead to a large number of intermediate calculations, which can require a lot of memory.

Applications of Distance Matrix

Distance matrices have a wide range of applications. Let's explore a few of them to understand their significance.


Distance matrices are frequently used in clustering algorithms, such as hierarchical clustering and k-means clustering. These algorithms rely on the concept of grouping objects that are close to each other in the distance matrix.


In biology, distance matrices are used to infer evolutionary relationships between species. DNA or protein sequences are compared, and their dissimilarity is computed to construct phylogenetic trees.

Image Processing

In image processing, distance matrices help in object recognition and segmentation. By measuring the distances between pixels or image features, objects can be identified and separated.

Recommender Systems

In recommendation systems like collaborative filtering, distance matrices are used to find similar users or items. The idea is to recommend items to a user based on their similarity to other users' preferences.


Distance matrices are a fundamental concept in various fields, and Python provides powerful tools for their computation. Whether you are working on data analysis, machine learning, biology, or any other domain, understanding and utilizing distance matrices can significantly enhance your problem-solving capabilities.

In this blog post, we explored what distance matrices are, how to compute them in Python using libraries like NumPy and SciPy, and some of their key applications. By mastering distance matrices, you can unlock new possibilities in your data-driven projects and research. So go ahead, start experimenting, and leverage the power of distance matrices in Python for your next project!

You can also check these blogs:

  1. Python Mock Side Effect: Controlling Behavior in Your Tests
  2. How to Insert a Variable into a String in Python?
  3. Viterbi Algorithm in Python
  4. Calculating Distance in Python
  5. Count the Number of Occurrences in a List in Python
  6. Intersection of Two Lists in Python
  7. What is For Loop Countdown in Python?
  8. How to draw a circle in Python?