no code implementations • 16 Apr 2013 • Joel Lang, James Henderson
Previous work has shown the effectiveness of random walk hitting times as a measure of dissimilarity in a variety of graph-based learning problems such as collaborative filtering, query suggestion or finding paraphrases.