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 …

A bipartite graph contains inter-set edges between two disjoint vertex sets, and is widely
used to model real-world data, such as user-item purchase records, author-article …

In bipartite graph analysis, similarity measures play a pivotal role in various applications.
Among existing metrics, the Bidirectional Hidden Personalized PageRank (BHPP) stands …

Given an undirected graph G, the effective resistance r (s, t) measures the dissimilarity of
node pair s, t in G, which finds numerous applications in real-world problems, such as …

Bipartite graphs, formed by two vertex layers, arise as a natural fit for modeling the
relationships between two groups of entities. In bipartite graphs, common neighborhood …

The biharmonic distance (BD) is a fundamental metric that measures the distance of two
nodes in a graph. It has found applications in network coherence, machine learning, and …

Graph representation learning (GRL) is to encode graph elements into informative vector
representations, which can be used in downstream tasks for analyzing graph-structured data …

Role-based similarity search, predicated on the topological structure of graphs, is a highly
effective and widely applicable technique for various real-world information extraction …

그래프 내에서 개인화된 페이지랭크 (Personalized PageRank, PPR) 를 계산하는 것은 검색,
추천, 지식발견 등 여러 분야에서 광범위하게 활용되는 중요한 작업이다. 개인화된 …