33 citations · 34 across the 3 of their papers we have counts for
5 papers
Effective and Scalable Clustering on Massive Attributed Graphs
Renchi Yang, Jieming Shi, Yin Yang +3
Given a graph G where each node is associated with a set of attributes, and a parameter k specifying the number of output clusters, k-attributed graph clustering (k-AGC) groups nod…
Realtime Index-Free Single Source SimRank Processing on Web-Scale Graphs
Jieming Shi, Tianyuan Jin, Renchi Yang +2
Given a graph G and a node u in G, a single source SimRank query evaluates the similarity between u and every node v in G. Existing approaches to single source SimRank computation…
Efficient Algorithms for Approximate Single-Source Personalized PageRank Queries
Sibo Wang, Renchi Yang, Runhui Wang +5
Given a graph , a source node and a target node , the personalized PageRank (PPR) of with respect to is the probability that a random walk starting from termi…
Homogeneous Network Embedding for Massive Graphs via Reweighted Personalized PageRank
Renchi Yang, Jieming Shi, Xiaokui Xiao +2
Given an input graph G and a node v in G, homogeneous network embedding (HNE) maps the graph structure in the vicinity of v to a compact, fixed-dimensional feature vector. This pap…
Efficient Estimation of Heat Kernel PageRank for Local Clustering
Renchi Yang, Xiaokui Xiao, Zhewei Wei +3
Given an undirected graph G and a seed node s, the local clustering problem aims to identify a high-quality cluster containing s in time roughly proportional to the size of the clu…