Maximizing influence spread in modular social networks by optimal resource allocation

Authors:
Tianyu Cao;Xindong Wu;Song Wang;Xiaohua Hu
Affiliations:
Department of Computer Science, University of Vermont, Vermont 05405, United States;Department of Computer Science, University of Vermont, Vermont 05405, United States and School of Computer Science and Information Engineering, Hefei University of Technology, Hefei 230009, China;Department of Computer Science, University of Vermont, Vermont 05405, United States;College of Information Science and Technology, Drexel University, Pennsylvania 19104, United States
Venue:
Expert Systems with Applications: An International Journal
Year:
2011

Citing 8
Cited 2

Mining the network value of customers

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Mining knowledge-sharing sites for viral marketing

Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing the spread of influence through a social network

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Cost-effective outbreak detection in networks

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient influence maximization in social networks

Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Extracting influential nodes for information diffusion on a social network

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Minimizing the spread of contamination by blocking links in a network

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Finding spread blockers in dynamic networks

SNAKDD'08 Proceedings of the Second international conference on Advances in social network mining and analysis

Identifying valuable customers on social networking sites for profit maximization

Expert Systems with Applications: An International Journal
Application of the ant colony optimization algorithm to competitive viral marketing

SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications

Quantified Score

Hi-index	12.05

Visualization

Abstract

Influence maximization in a social network is to target a given number of nodes in the network such that the expected number of activated nodes from these nodes is maximized. A social network usually exhibits some degree of modularity. Previous research efforts that made use of this topological property are restricted to random networks with two communities. In this paper, we firstly transform the influence maximization problem in a modular social network to an optimal resource allocation problem. We assume that the communities of the social network are disconnected. We then propose a recursive relation for finding such an optimal allocation. We prove that finding an optimal allocation in a modular social network is NP-hard and propose a new dynamic programming algorithm to solve the problem. We name our new algorithm OASNET (Optimal Allocation in a Social NETwork). We compare OASNET with the high degree heuristics, the single degree discount heuristics, and the degree discount heuristics on three real world datasets. Experimental results show that OASNET outperforms comparison heuristics significantly on the independent cascade model when the diffusion probability is greater than a certain threshold.