Hands-On High Performance with Go

K-nearest neighbors

Hierarchical clustering is a clustering method in which an object that is associated with a child cluster is also associated with the parent clusters. The algorithm begins with all of the individual datapoints in the data struct being assigned to individual clusters. The nearest clusters to one another merge. This pattern continues until all the datapoints have an association with another datapoint. Hierarchical clustering is often displayed using a charting technique called a dendrogram. Hierarchical clustering is O(n²), so it's not typically used for large datasets.

The K-nearest neighbors (KNN) algorithm is a hierarchical algorithm often used in machine learning. One of the most popular ways to find KNN data in Go is ...