39 citations · 88 across the 4 of their papers we have counts for
4 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…
PANE: scalable and effective attributed network embedding
Renchi Yang, Jieming Shi, Xiaokui Xiao +3
Given a graph G where each node is associated with a set of attributes, attributed network embedding (ANE) maps each node v in G to a compact vector Xv, which can be used in downst…
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…
Collecting and Analyzing Multidimensional Data with Local Differential Privacy
Ning Wang, Xiaokui Xiao, Yin Yang +5
Local differential privacy (LDP) is a recently proposed privacy standard for collecting and analyzing data, which has been used, e.g., in the Chrome browser, iOS and macOS. In LDP,…