Add hierarchical clustering algorithm using single linkage #13292
+56
−0
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Describe your change:
This pull request adds a hierarchical clustering algorithm using single linkage and Euclidean distance. The implementation is written in pure NumPy and demonstrates how to group data points based on minimum pairwise distances. The algorithm stops when two clusters remain.
The code includes:
→ https://en.wikipedia.org/wiki/Hierarchical_clustering
Checklist: