33 citations · 135 across the 23 of their papers we have counts for
5 papers · 1 filter
Efficient High-Quality Clustering for Large Bipartite Graphs
Renchi Yang, Jieming Shi
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 publica…
Efficient and Effective Similarity Search over Bipartite Graphs
Renchi Yang
Similarity search over a bipartite graph aims to retrieve from the graph the nodes that are similar to each other, which finds applications in various fields such as online adverti…
Efficient Estimation of Pairwise Effective Resistance
Renchi Yang, Jing Tang
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 rec…
Node-wise Diffusion for Scalable Graph Learning
Keke Huang, Jing Tang, Juncheng Liu +2
Graph Neural Networks (GNNs) have shown superior performance for semi-supervised learning of numerous web applications, such as classification on web services and pages, analysis o…
Efficient Approximation Algorithms for Spanning Centrality
Shiqi Zhang, Renchi Yang, Jing Tang +2
Given a graph , the spanning centrality (SC) of an edge measures the importance of for to be connected. In practice, SC has seen extensive applic…