K-nearest Neighbors

NN (Nearest Neighbor) finds the k-nearest neighbors from an unstructured data set. The sequential NN algorithm reads in one record at a time, calculates the Euclidean distance from the target latitude and longitude, and evaluates the k nearest neighbors. The parallel versions read in many records at a time, execute the distance calculation on multiple threads, and the master thread updates the list of nearest neighbors.

Retrieved from “https://www.cs.virginia.edu/~skadron/wiki/rodinia/index.php?title=Nearest_Neighbor&oldid=192

  • k-nearest_neighbors.txt
  • Last modified: 2018/10/03 17:48
  • by root