Skip to content

Tag Archives: similarity

matrix multiplication in mySQL

Background For a while now, there has been a need in a project of mine to perform a large-scale matrix multiplication. Here, large-scale involves the multiplication of a 2000x2000 square matrix with another matrix containing labels.  A simpler example is projecting a matrix containing a set of class features into a 2-d Cartesian space for […]

fast top-k similarity computation in matlab

When pre-computing a similarity matrix, there there is a large cost in both time and memory for computing pairwise similarity between every sample, O(N^2).  There are two main ways to slightly reduce the cost of either one of these demands... Approximate Hashing: Hashing projects a set of features into a lower dimensional representation while simultaneously […]