algorithm – by Ryan Levy
Improving SVD speeds by assuming a low rank approximation and exploiting randomization. Read More ›
algorithm – by Yubo 'Paul' Yang
Kriging is an interpolation method that provides confidence interval to its predictions. Kriging works by minimizing the variance of the prediction error over existing data. Read More ›
algorithm – by Brian Busemeyer
BK-Tree is an efficient method for determining the closest member of a set to another point outside the set. Read More ›
algorithm – by Dima Kochkov
GANs are Neural Network architecture comprised of two networks: generator and discriminator, that are pitted against each other. Read More ›
algorithm – by Kiel Williams
For a general graph with an arbitrary number of nodes and edges, it's usually not obvious what the shortest path is between two nodes. Dijkstra's algorithm is a famous method for systematically determining the length of that shortest path. I explore how to implement this algorithm for a simple graph in 2D, and show how it still works even if the path is subject to some simple constraints. Read More ›