Abstract
Maximizing product adoption within a customer social network under a constrained advertising budget is an important special case of the general influence maximization problem. Specialized optimization techniques that account for product correlations and community effects can outperform network-based techniques that do not model interactions that arise from marketing multiple products to the same consumer base. However, it can be infeasible to use exact optimization methods that utilize expensive matrix operations on larger networks without parallel computation techniques. In this chapter, we present a hierarchical influence maximization approach for product marketing that constructs an abstraction hierarchy for scaling optimization techniques to larger networks. An exact solution is computed on smaller partitions of the network, and a candidate set of influential nodes is propagated upward to an abstract representation of the original network that maintains distance information. This process of abstraction, solution, and propagation is repeated until the resulting abstract network is small enough to be solved exactly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Anagnostopoulos A, Kumar R, Mahdian M (2008) Influence and correlation in social networks. In: Proceeding of the ACM SIGKDD international conference on knowledge discovery and data mining, pp 7–15
Apolloni A, Channakeshava K, Durbeck L, Khan M, Kuhlman C, Lewis B, Swarup S (2009) A study of information diffusion over a realistic social network model. In: Proceedings of the international conference on computational science and engineering, pp 675–682
Aral S, Walker D (2012) Identifying influential and susceptible members of social networks. Science 337(6092):337–341
Bagherjeiran A, Parekh R (2008) Combining behavioral and social network data for online advertising. In: IEEE international conference on data mining workshops (ICDMW), pp 837–846
Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Deng X, Graham FC (eds) Internet and network economics. Springer, Berlin, pp 306–311
Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: Saberi A (ed) Internet and network economics. Springer, Berlin, pp 539–550
Chen W, Collins A, Cummings R, Ke T et al (2011) Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of the SIAM international conference on data mining
Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining, pp 1029–1038
Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining, pp 199–208
Chen W, Yuan Y, Zhang L (2010) Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of the IEEE international conference on data mining (ICDM), pp 88–97
Hartline J, Mirrokni V, Sundararajan M (2008) Optimal marketing strategies over social networks. In: Proceeding of the international conference on world wide web. ACM, pp 189–198
Hung B (2010) Optimization-based selection of influential agents in a rural Afghan social network. Master’s thesis, Massachusetts Institute of Technology
Hung B, Kolitz S, Ozdaglar A (2011) Optimization-based influencing of village social networks in a counterinsurgency. In: Proceedings of the international conference on social computing, behavioral-cultural modeling and prediction, pp 10–17
Kempe D, Kleinberg J, Tardos É (2003) Maximizing the spread of influence through a social network. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 137–146
Kempe D, Kleinberg J, Tardos É (2005) Influential nodes in a diffusion model for social networks. In: Automata, Languages and Programming, pp 1127–1138
Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. In: Knowledge discovery in databases (PKDD), pp 259–271
Kimura M, Saito K, Nakano R, Motoda H (2009) Finding influential nodes in a social network from information diffusion data. Social computing and behavioral modeling. Springer, New York, pp 1–8
Leborgne D (1982) Calcul différentiel et géometrie. Presses universitaires de France
Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the ACM SIGKDD international conference on knowledge discovery and data mining, pp 420–429
Liow L, Cheng S, Lau H (2012) Niche-seeking in influence maximization with adversary. In: Proceedings of the annual international conference on electronic commerce. ACM, pp 107–112
Maghami M, Sukthankar G (2010) Identifying influential agents for advertising in multi-agent markets. In: Proceedings of the international conference on autonomous agents and multiagent systems, pp 687–694
Maghami M, Sukthankar G (2013) Hierarchical influence maximization for advertising in multi-agent markets. In: Proceedings of the IEEE/ACM international conference on advances in social networks analysis and mining. Niagara Falls, Canada, pp 21–27
Pathak N, Banerjee A, Srivastava J (2010) A generalized linear threshold model for multiple cascades. In: International conference on data mining (ICDM), pp 965–970
Shakarian P, Paulo D (2012) Large social networks can be targeted for viral marketing with small seed sets. In: Proceedings of the IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM), pp 1–8
Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowl Discov 1–32
Yang W, Dia J, Cheng H, Lin H (2006) Mining social networks for targeted advertising. In: Proceedings of the annual Hawaii international conference on system sciences. IEEE Computer Society
Acknowledgments
This research was supported in part by NSF IIS-08451.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Maghami, M., Sukthankar, G. (2014). Scaling Influence Maximization with Network Abstractions. In: Missaoui, R., Sarr, I. (eds) Social Network Analysis - Community Detection and Evolution. Lecture Notes in Social Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-12188-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-12188-8_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12187-1
Online ISBN: 978-3-319-12188-8
eBook Packages: Computer ScienceComputer Science (R0)