5 citations · 9 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…
Efficient Approximation Algorithms for Adaptive Influence Maximization
Keke Huang, Jing Tang, Kai Han +5
Given a social network and an integer , the influence maximization (IM) problem asks for a seed set of nodes from to maximize the expected number of nodes influe…
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…
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…
Refutations on "Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study"
Wei Lu, Xiaokui Xiao, Amit Goyal +2
In a recent SIGMOD paper titled "Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study", Arora et al. [1] undertake a performance benchmarking study of seve…