57 citations · 198 across the 19 of their papers we have counts for
5 papers · 1 filter
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…
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
Shuang Cui, Kai Han, Jing Tang +3
Submodular maximization has found extensive applications in various domains within the field of artificial intelligence, including but not limited to machine learning, computer vis…
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…
How Fragile is Relation Extraction under Entity Replacements?
Yiwei Wang, Bryan Hooi, Fei Wang +6
Relation extraction (RE) aims to extract the relations between entity names from the textual context. In principle, textual context determines the ground-truth relation and the RE…