Browsing Faculty of Graduate Studies Online Theses by Subject "K-D trees"
Now showing items 1-1 of 1
-
Fast K-Means Clustering Via K-D Trees, Sampling, and Parallelism
(2019-08-29)K-means is a commonly used method for clustering in applications that require fast response time due to its speed. As data becomes large (millions of data points), the classical implementation may not achieve the performance ...