A random walk is known as a random process which describes a path including a
succession of random steps in the mathematical space. It has increasingly been popular in …

Data mining of massive data sets is transforming the way we think about crisis response,
marketing, entertainment, cybersecurity and national intelligence. Collections of documents …

Personalized PageRank (PPR) is a traditional measure for node proximity on large graphs.
For a pair of nodes and, the PPR value equals the probability that an-discounted random …

Graphs appear in numerous applications including cyber-security, the Internet, social
networks, protein networks, recommendation systems, and many more. Graphs with millions …

Given a large graph, how can we calculate the relevance between nodes fast and
accurately? Random walk with restart (RWR) provides a good measure for this purpose and …

Personalized PageRank (PPR) is an important variation of PageRank, which is a widely
applied popularity measure for Web search. Unlike the original PageRank, PPR is a node …

Search for objects similar to a given query object in a network has numerous applications
including web search and collaborative filtering. We use the notion of structural similarity to …

Estimating similarity between vertices is a fundamental issue in network analysis across
various domains, such as social networks and biological networks. Methods based on …

Graphs appear in numerous applications including cyber security, the Internet, social
networks, protein networks, recommendation systems, citation networks, and many more …

Diversified ranking on graphs is a fundamental mining task and has a variety of high-impact
applications. There are two important open questions here. The first challenge is the …