Last time I’ve shown how I’ve gone from 34 hours to 11. This time we go faster. To go faster I have to do less.
The current implementation of
Similarity iterates over one vector and checks if that ingredient exists in the second one. Since those vectors are sparse the chance of a miss is big. This means that I am losing computational power on iterating and calling
How to iterate only over the mutually owned ones and do it fast?Continue reading...