The agglomerative hierarchical clustering algorithm is applied to the matrix containing pearson correlation as the distance measure. Here a threshold "delta" is considered before proceeding to clustering. If any of the data values in the pearson matrix is greater than delta, only then clustering is done. Note: Pearson Correlation is inversely related to distance i.e if pearson correlation is more, distance between the instances is less. Finally, the algorithm is evaluated by silhouette coefficient.
-
Notifications
You must be signed in to change notification settings - Fork 2
swastipriya/Agglomerative-hierarchical-clustering-on-pearson-correlation
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description or website provided.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published