The assessment of node-to-node similarities based on graph topology arises in a myriad of
applications, eg, web search. SimRank is a notable measure of this type, with the intuition …

With heterogeneous information networks becoming ubiquitous and complex, lots of data
mining tasks have been explored, including clustering, collaborative filtering and link …

As the number of people who use scientific literature databases has grown, the demand for
literature retrieval services has steadily increased. One of the most popular retrieval service …

Graph is a famous data structure that has prevalent applications in the real world, including
social networks, biological networks, and computer networks. In these applications, graph …

Single-source SimRank query calculates the similarity between a query node and every
node in a graph, which traverses the paths starting from the query node for similarity …

SimRank is an effective and widely adopted measure to quantify the structural similarity
between pairs of nodes in a graph. In this paper we study the problem of top-k SimRank …

Measuring similarities among different vertices is a fundamental problem in graph analysis.
Among different similarity measurements, SimRank is one of the most promising and …

RoleSim and SimRank are among the popular graph-theoretic similarity measures with
many applications in, eg, web search, collaborative filtering, and sociometry. While RoleSim …

SimRank is an attractive link-based similarity measure used in fertile fields of Web search
and sociometry. However, the existing deterministic method by Kusumoto et al. for retrieving …

SimRank is a similarity measure between vertices in a graph, which has become a
fundamental technique in graph analytics. Recently, many algorithms have been proposed …