Can I read Fast Proximity Search in Large Graphs on EtoBox?

Fast Proximity Search in Large Graphs by SaMee KHan is a document available to read on EtoBox.

What is Fast Proximity Search in Large Graphs about?

The document discusses an algorithm for fast incremental proximity search in large graphs using truncated hitting and commute times, which improves upon traditional methods by focusing on shorter paths. It highlights the advantages of this approach for personalized recommendations and link prediction tasks, demonstrating its efficiency in processing queries on large datasets. Experimental results indicate that the proposed measures outperform personalized pagerank in various scenarios.

Author

SaMee KHan

Language

EN