Abstract
In this paper, we introduce a novel and generalized version of the influence maximization problem in social networks, which we call as Budgeted Influence Maximization with Cross-sell of Products (B-IMCP), and it considers simultaneously the following three practical aspects: (i) Often cross-sell among products is possible, (ii) Product-specific costs (and benefits) for promoting the products have to be considered, and (iii) Since a company often has budget constraints, the initial seeds have to be chosen within a given budget. In particular, we consider that the cross-sell relationships among the products of a single company are given by an arbitrary bipartite graph. We explore two variants of cross-sell, one weak and one strong, and also assume product-specific costs and benefits. This leads to two different versions of the B-IMCP problem. Given a fixed budget, one of the key issues associated with each version of the B-IMCP problem is to choose the initial seeds within this budget not only for the individual products, but also for promoting cross-sell phenomenon among these products. The following are the specific contributions of this paper: (i) We propose a novel influence propagation model to capture both the cross-sell phenomenon and the costs–benefits for the products; (ii) For each version of the B-IMCP problem, we note that the problem turns out to be NP-hard, and then, we present a simple greedy approximation algorithm for the same. We derive the approximation ratio of this greedy algorithm by drawing upon certain key results from the theory of matroids; (iii) We then outline three heuristics based on well-known concepts from the sociology literature; and (iv) Finally, we experimentally compare and contrast the proposed algorithms and heuristics using certain well-known social network data sets such as WikiVote trust network, Epinions, and Telco call detail records data. Based on the experiments, we consistently found that the stronger the cross-sell relationship between the products, the larger the overlap between the seeds of these products and lesser the distances among the corresponding non-overlapping seeds.
Similar content being viewed by others
References
Aggarwal C, Khan A, Yan X (2011) On flow authority discovery in social networks. In: Proceedings of SIAM conference on data mining (SDM), pp 522–533
Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: Proceedings of the 3rd workshop on internet and network economics (WINE), pp 306–311
Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: Proceedings of the 6rd workshop on internet and network economics (WINE), pp 539–550
Budak C, Agrawal D, Abbadi AE (2011) Limiting the spread of misinformation in social networks. In: Proceedings of the 20th international conference on World Wide Web (WWW), pp 665–674
Calinescu G, Chekuri C, Pal M, Vondrak J (2007) Maximizing a submodular set function subject to a matroid constraint. In: Proceedings of IPCO, pp 182–196
Calvo-Armengol A (2004) Job contact networks. J Econ Theory 115(1):191–206
Carnes T, Nagarajan C, Wild S, van Zuylen A (2007) Maximizing in uence in a competitive social network: a follower’s perspective. In: Proceedings of the 9th international conference on electronic commerce (ICEC), pp 351–360
Chen W, Collins A, Cummings R, Ke T, Liu Z, Rincon D, Sun X, Wang Y, Wei W, Yuan Y (2011) Influence maximization in social networks when negative opinions may emerge and propagate. In: Proceedings of SIAM SDM
Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining (KDD), pp 937–944
Datta S, Majumder A, Shrivastava N (2010) Viral marketing for multiple products. In: Proceedings of IEEE ICDM, pp 118–127
Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the 7th SIGKDD international conference on knowledge discovery and data mining (KDD), pp 57–66
Easley D, Kleinberg J (2010) Networks, crowds, and markets: reasoning about a highly connected world. Cambridge University Press, Cambridge
Even-Dar E, Shapira A (2007) A note on maximizing the spread of influence in social networks. In: Proceedings of the 3rd workshop on internet and network economics (WINE), pp 281–286
Gao C, Liu J, Zhong N (2011) Network immunization and virus propagation in email networks: experimental evaluation and analysis. Knowl Inf Syst 27(2):253–279
Goldenberg J, Libai B, Muller E (2001) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Marketing Lett 12(3):211–223
Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83:1420–1443
He X, Song G, Chen W, Jiang Q (2012) Influence blocking maximization in social networks under the competitive linear threshold model. In: Proceedings of the 12th SIAM international conference on data mining (SDM)
Jackson M (2008) Social Economic Networks. Princeton University Press, Princeton
Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th SIGKDD international conference on knowledge discovery and data mining (KDD), pp 137–146
Kimura M, Saito K (2006) Tractable modles for information diffusion in social networks. In: Proceedings of 10th European conference on principles and practice of knowledge discovery in databases (PKDD), pp 259–271
Leskovec J, Adamic L, Huberman B (2007) The dynamics of viral marketing. ACM Trans Web 1(1), Article Number 5, 39 p. doi:10.1145/1232722.1232727
Leskovec J, Huttenlocher D, Kleinberg J (2010) Signed networks in social media. In: Proceedings of the 28th ACM SIGCHI conference on human factors in computing systems (CHI), pp 1361–1370
Leskovec J, Krause A, Guestrin C, Faloutsos C, VanBriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the 13th SIGKDD international conference on knowledge discovery and data mining (KDD), pp 420–429
Nanavati A, Singh R, Chakraborty D, Dasgupta K, Mukherjea S, Das G, Gurumurthy S, Joshi A (2008) Analyzing the structure and evolution of massive telecom graphs. IEEE Trans Knowl Discov Data Eng 20(5):703–718
Nemhauser G, Wolsey L, Fisher M (1978) An analysis of approximations for maximizing submodular set functions-1. Math Program 14(1):265–294
Newman MEJ (2009) The structure of scientific collaboration networks. Proc Natl Acad Sci (PNAS) 98:404–409
Ramasuri N, Narahari Y (2011) A shapley value based approach to discover influential nodes in social networks. IEEE Trans Autom Sci Eng (IEEE TASE) 8(1):130–147
Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: Proceedings of ISWC
Richardson M, Domingos P (2002) Mining knowledge-sharing sites for viral marketing. In: Proceedings of the 8th SIGKDD international conference on knowledge discovery and data mining (KDD), pp 61–70
Rogers E (1995) Diffusion of innovations. Free Press, New York
Schelling T (1978) Micromotives and macrobehavior. W.W, Norton and Company, New York, USA
Wasserman S, Faust K (1994) Social network analysis. Cambridge University Press, Cambridge
Acknowledgments
We sincerely thank the three reviewers and the associate editor for their detailed painstaking reviews. Their insightful and valuable comments helped us improve the quality of the paper significantly.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Narayanam, R., Nanavati, A.A. Design of viral marketing strategies for product cross-sell through social networks. Knowl Inf Syst 39, 609–641 (2014). https://doi.org/10.1007/s10115-013-0630-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-013-0630-1