Personalized PageRank (PPR) is a widely used node proximity measure in graph mining
and network analysis. Given a source node s and a target node t, the PPR value π (s, t) …

Second-order random walk is an important technique for graph analysis. Many applications
including graph embedding, proximity measure and community detection use it to capture …

Given a graph, how can we quantify similarity between two nodes in an effective and
scalable way? SimRank is an attractive measure of pairwise similarity based on graph …

SimRank is a classic measure of the similarities of nodes in a graph. Given a node u in
graph G=(V,E), a\em single-source SimRank query returns the SimRank similarities s(u,v) …

Similarity among entities in graphs plays a key role in data analysis and mining. SimRank is
a widely used and popular measurement to evaluate the similarity among the vertices. In …

Single-source and top-$ k $ SimRank queries are two important types of similarity search in
graphs with numerous applications in web mining, social network analysis, spam detection …

Second-order random walk is an important technique for graph analysis. Many applications
use it to capture higher-order patterns in the graph, thus improving the model accuracy …

SimRank is a popular link-based similarity measurement among nodes in a graph. To
compute the all-pairs SimRank matrix accurately, iterative methods are usually used. For …

SimRank is a popular measurement for evaluating the node-to-node similarities based on
the graph topology. In recent years, single-source and top-k SimRank queries have received …

SimRank-based similarity joins, which mainly include threshold-based and top-k similarity
joins, are important types of all-pair SimRank queries. Although a line of related algorithms …