210 citations · 1.2k across the 48 of their papers we have counts for
8 papers · 1 filter
Efficient Approximation Algorithms for Adaptive Target Profit Maximization
Keke Huang, Jing Tang, Xiaokui Xiao +2
Given a social network , the profit maximization (PM) problem asks for a set of seed nodes to maximize the profit, i.e., revenue of influence spread less the cost of seed select…
The Disruptions of 5G on Data-driven Technologies and Applications
Dumitrel Loghin, Shaofeng Cai, Gang Chen +12
With 5G on the verge of being adopted as the next mobile network, there is a need to analyze its impact on the landscape of computing and data management. In this paper, we analyze…
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…
Efficient Approximation Algorithms for Adaptive Seed Minimization
Jing Tang, Keke Huang, Xiaokui Xiao +4
As a dual problem of influence maximization, the seed minimization problem asks for the minimum number of seed nodes to influence a required number of users in a given social n…
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,…
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…