feat: added centroid algorithm #1520
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Code Coverage
|
dkhawk
approved these changes
Jun 3, 2025
googlemaps-bot
pushed a commit
that referenced
this pull request
Jun 3, 2025
|
🎉 This PR is included in version 3.14.0 🎉 The release is available on:
Your semantic-release bot 📦🚀 |
|
🎉 This PR is included in version 3.14.0 🎉 The release is available on:
Your semantic-release bot 📦🚀 |
dkhawk
pushed a commit
that referenced
this pull request
Aug 6, 2025
* feat: added CentroidNonHierarchicalDistanceBasedAlgorithm.java * feat: added a test * docs: header
dkhawk
pushed a commit
that referenced
this pull request
Aug 6, 2025
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
This PR adds a new algorithm, CentroidNonHierarchicalDistanceBasedAlgorithm.java. This algorithm extends from NonHierarchicalDistanceBasedAlgorithm, and incorporates a function to calculate the center of a cluster based on the centroid (instead of the former approach, which only kept into consideration the first item of the cluster). It also adds a test, to keep our test coverage happy.