Week Starting 6/10/19 (Week 2)
This week I have extensively researched different algorithms to determine the similarities of a given dataset at different levels. I found that my dataset will be the Sloan Digital Sky Survey, which takes pictures of the sky in order to attempt to create a map of the universe. I have researched two of the three main methods that are currently widely accepted. The ones I researched were trees, mainly kd-trees, and graph based algorithms, mainly Navigable Small World graphs and Hierarchal Navigable Small World graphs (HNSW). I have started to run some of these algorithms with a practice dataset so that I can understand the usage better. The other main method is hashing, but it really doesn’t apply to the dataset that I will be working on. As of today, I am working on using map on the test dataset.
Comments
Post a Comment