Presentation
SIGN IN TO VIEW THIS PRESENTATION Sign In
k-Nearest Neighboor with Map Reduce MPI
DescriptionThis is the summary of a peachy parallel assignment centered on classifying objects based on a database of pre-classified objects; in particular this assignment uses the k-Nearest Neighbors method. With the increase of popularity of data science and machine learning, data science assignments have become more engaging for students. In this particular case, we rely on existing databases of machine learning problems to provide real world applications of the k-nearest neighbor algorithm. The databases being fairly large makes the runtime of the algorithm fairly slow, which makes the consideration of parallel computing natural. This incarnation of the assignment uses Map Reduce MPI and was used in an upper division parallel computing class. However the assignment can be adapted as a CS1/CS2 assignment or as a Data Structures assignment.
Author/Presenter
Event Type
Workshop
TimeMonday, 13 November 20235:01pm - 5:05pm MST
Location506
Education
State of the Practice
W