Added ome progress printing
merged simrank stuff
I have moved the linearized version of simrank into sim_rank_fast.py. There are a few issues. First we need to convert single_pair function into a weighted formulation. It is unclear exactly how to do this from the paper. I'm assuming that instead of counts for the alph and beta terms we have to use weights. However, we also need to divide by the correct normalizing factor. The second issue is with the index function. The way it works is that it sends several random walks, and adds any node to the index that shows up often. However, because every restaurant is connected to so many people, there is a high probability that even a common node will not show up on a random walk, making it not appear in the index. The index is the preprocessing step, and we only check similarity between nodes that exist in the index. Thus one way to solve this would be to dramatically increase the number of random walks we do. However the function is already taking ~30 mins to run so we should be careful there. Finally, I'm not sure if we need to change the graph for a bipartite formulation. I constructed an example of nx.Graph([(1, 4), (1, 5), (1, 6), (2, 4), (2, 5), (3, 6)]) to try to test this.
Merge branch 'master' of https://github.com/arjunmathur/cs224w