AGNES, known as Agglomerative Hierarchical clustering. This algorithm works by grouping the data one by one on the basis of the nearest distance measure of all the pairwise distance between the data point. Again distance between the data point is recalculated but which distance to consider when the groups has been formed? For this there are many available methods. Some of them are:
- Single-nearest distance or single linkage
- Complete-farthest distance or complete linkage
- Average-average distance or average linkage
- Centroid distance
- Ward's method - sum of squared euclidean distance is minimized
Requirements: Java 1.8+
Run following command in terminal:
javac AgnesGui.java
Run following command in terminal:
nis the number of points, you should replace it with a specific numberkis the number of clusters, you should replace it with a specific number (2 is recommended)
Run Terminal Version
java Agnes n
Run GUI Version
java AgnesGui k
