Skip to content
FacebookTwitterLinkedinYouTubeGitHubSubscribeEmailRSS
Close
Beyond Knowledge Innovation

Beyond Knowledge Innovation

Where Data Unveils Possibilities

  • Home
  • AI & ML Insights
  • Machine Learning
    • Supervised Learning
      • Introduction
      • Regression
      • Classification
    • Unsupervised Learning
      • Introduction
      • Clustering
      • Association
      • Dimensionality Reduction
    • Reinforcement Learning
    • Generative AI
  • Knowledge Base
    • Introduction To Python
    • Introduction To Data
    • Introduction to EDA
  • References
HomeImplementationUnsupervised LearningClusteringCophenetic coefficient
Clustering

Cophenetic coefficient

March 15, 2024March 15, 2024CEO 469 views
The cophenetic coefficient is a measure used to evaluate the quality of a hierarchical clustering solution. It quantifies how faithfully the hierarchical structure (dendrogram) preserves the original pairwise distances or dissimilarities between data points.

Here’s how it works:

  1. Calculate the original pairwise distances or dissimilarities: This is typically done using some distance metric such as Euclidean distance or correlation coefficient, depending on the nature of the data.
  2. Perform hierarchical clustering: Apply a hierarchical clustering algorithm to the data to create a dendrogram, which represents the hierarchical structure of the clustering solution.
  3. Calculate the cophenetic distances: These are the distances between each pair of data points based on the dendrogram structure. This is done by measuring the height at which the two points’ branches merge in the dendrogram.
  4. Compute the correlation between original distances and cophenetic distances: Finally, the cophenetic coefficient is computed as the Pearson correlation coefficient between the original pairwise distances and the cophenetic distances. This coefficient ranges between -1 and 1, with 1 indicating perfect preservation of original distances and values closer to 0 indicating poor preservation.

A high cophenetic coefficient suggests that the hierarchical clustering solution accurately captures the underlying structure of the data in terms of pairwise dissimilarities. It is a useful measure for comparing different clustering solutions or for assessing the appropriateness of a particular clustering algorithm for a given dataset.

coefficient, cophenetic, dendrogram, hierarchical clustering

Post navigation

Previous Post
Previous post: Complete linkage hierarchical clustering
Next Post
Next post: Unsupervised Learning Dimensionality Reduction – Feature Elimination vs Extraction

You Might Also Like

No image
Single linkage hierarchical clustering
March 15, 2024 Comments Off on Single linkage hierarchical clustering
No image
What is Silhouette Coefficient
March 11, 2024 Comments Off on What is Silhouette Coefficient
No image
Linear regression model coefficients
February 28, 2024 Comments Off on Linear regression model coefficients
  • Recent
  • Popular
  • Random
  • No image
    1 year ago Low-Rank Factorization
  • No image
    1 year ago Perturbation Test for a Regression Model
  • No image
    1 year ago Calibration Curve for Classification Models
  • No image
    March 15, 20240Single linkage hierarchical clustering
  • No image
    April 17, 20240XGBoost (eXtreme Gradient Boosting)
  • No image
    April 17, 20240Gradient Boosting
  • No image
    February 11, 2024How-to: save a Google Colab notebook as…
  • No image
    February 9, 2024What is Gaussian Distribution?
  • No image
    February 22, 2024What is Uniform Distribution?
  • Implementation (55)
    • EDA (4)
    • Neural Networks (10)
    • Supervised Learning (26)
      • Classification (17)
      • Linear Regression (8)
    • Unsupervised Learning (11)
      • Clustering (8)
      • Dimensionality Reduction (3)
  • Knowledge Base (44)
    • Python (27)
    • Statistics (6)
April 2026
M T W T F S S
 12345
6789101112
13141516171819
20212223242526
27282930  
« Oct    

We are on

FacebookTwitterLinkedinYouTubeGitHubSubscribeEmailRSS

Subscribe

© 2026 Beyond Knowledge Innovation
FacebookTwitterLinkedinYouTubeGitHubSubscribeEmailRSS