research
∙
05/25/2023
Efficient Approximation Algorithms for Spanning Centrality
Given a graph 𝒢, the spanning centrality (SC) of an edge e measures the ...
share
research
∙
02/07/2021
Effective and Scalable Clustering on Massive Attributed Graphs
Given a graph G where each node is associated with a set of attributes, ...
research
∙
12/13/2020
Active Learning for Node Classification: The Additional Learning Ability from Unlabelled Nodes
Node classification on graph data is an important task on many practical...
research
∙
10/22/2020
Fast Approximate CoSimRanks via Random Projections
Given a graph G with n nodes, and two nodes u,v in G, the CoSim-Rank val...
research
∙
02/19/2020
Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs
Given a graph G and a node u in G, a single source SimRank query evaluat...
research
∙
08/28/2019
Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries
Given a graph G, a source node s and a target node t, the personalized P...
research
∙
06/17/2019
Homogeneous Network Embedding for Massive Graphs via Personalized PageRank
Given an input graph G and a node v in G, homogeneous network embedding ...
research
∙
04/03/2019