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) …

Link prediction in complex network is an important issue in network science. Recently,
various structure-based similarity methods have been proposed. Most of algorithms are …

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 similarity measure for graph nodes that has numerous applications in practice.
Scalable SimRank computation has been the subject of extensive research for more than a …

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) …

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 …

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 …

Person re-identification (person Re-Id) aims to retrieve the pedestrian images of the same
person that captured by disjoint and non-overlapping cameras. Lots of researchers recently …

Despite its popularity, SimRank is computationally costly, in both time and space. In
particular, its recursive nature poses a great challenge in using modern distributed …

Over the last decade, there has been a trend where water utility companies aim to make
water distribution networks more intelligent in order to improve their quality of service …