`scipy.cluster.hierarchy:cophenet`

source: /scipy/cluster/hierarchy.py :1576

Signature

def cophenet ( Z , Y = None )

Summary

Calculate the cophenetic distances between each observation in the hierarchical clustering defined by the linkage Z.

Extended Summary

Suppose p and q are original observations in disjoint clusters s and t, respectively and s and t are joined by a direct parent cluster u. The cophenetic distance between observations i and j is simply the distance between clusters s and t.

Parameters

Z : ndarray: The hierarchical clustering encoded as an array (see linkage function).
Y : ndarray (optional): Calculates the cophenetic correlation coefficient c of a hierarchical clustering defined by the linkage matrix Z of a set of $n$ observations in $m$ dimensions. Y is the condensed distance matrix from which Z was generated.

Returns

c : ndarray: The cophentic correlation distance (if Y is passed).
d : ndarray: The cophenetic distance matrix in condensed form. The $ij$ th entry is the cophenetic distance between original observations $i$ and $j$ .

Notes

Array API Standard Support

cophenet has experimental support for Python Array API Standard compatible backends in addition to NumPy. Please consider testing these features by setting an environment variable SCIPY_ARRAY_API=1 and providing CuPy, PyTorch, JAX, or Dask arrays as array arguments. The following combinations of backend and device (or other capability) are supported.

====================  ====================  ====================
Library               CPU                   GPU
====================  ====================  ====================
NumPy                 ✅                     n/a                 
CuPy                  n/a                   ⛔                   
PyTorch               ✅                     ⛔                   
JAX                   ✅                     ⛔                   
Dask                  ⚠️ merges chunks      n/a                 
====================  ====================  ====================

See dev-arrayapi for more information.

Examples

from scipy.cluster.hierarchy import single, cophenet
from scipy.spatial.distance import pdist, squareform

✓

Given a dataset ``X`` and a linkage matrix ``Z``, the cophenetic distance between two points of ``X`` is the distance between the largest two distinct clusters that each of the points:

X = [[0, 0], [0, 1], [1, 0],
     [0, 4], [0, 3], [1, 4],
     [4, 0], [3, 0], [4, 1],
     [4, 4], [3, 4], [4, 3]]

✓

``X`` corresponds to this dataset :: x x x x x x x x x x x x

Z = single(pdist(X))
Z
cophenet(Z)

✓

The output of the `scipy.cluster.hierarchy.cophenet` method is represented in condensed form. We can use `scipy.spatial.distance.squareform` to see the output as a regular matrix (where each element ``ij`` denotes the cophenetic distance between each ``i``, ``j`` pair of points in ``X``):

squareform(cophenet(Z))

✓

In this example, the cophenetic distance between points on ``X`` that are very close (i.e., in the same corner) is 1. For other pairs of points is 2, because the points will be located in clusters at different corners - thus, the distance between these clusters will be larger.

Aliases

scipy.cluster.hierarchy.cophenet