Abstract
The growing importance of online social networks where people share information with others leads to the emergence of viral marketing, a new way to promote the sales of products. A derivation of classical Influence Maximization (IM) problem is the Profit Maximization (PM) problem that we focus on in this paper. We propose the PM problem with a cardinality constraint in order to make the problem closer to the real world. Without a fixed and pre-determined budget for seed selection, the profit spread metric of PM considers the total benefit and cost. The difference between influence spread metric and profit spread metric is that the latter is no longer monotone and lose the property of submodularity in general. Due to the natural form as the difference between two submodular functions, the profit spread metric admits a DS decomposition. What matters is that we design a Marginal increment-based Prune and Search (MPS) algorithm. From the perspective of marginal increment, MPS algorithm can compute profit spread more directly and accurately. Extensive experiments demonstrate the effective and outperformance of our algorithm.
Supported by National Natural Science Foundation of China under Grant No. 11991022 and No. 12071459. We would like to express our appreciation to the anonymous reviewers who have helped to improve the paper.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
George D.: Google, Facebook and Amazon are the only winners in Ecommerce. https://www.entrepreneur.com/article/328478. Last accessed 5 Sep 2020
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137–146. ACM, New York (2003)
Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1029–1038. ACM, New York (2010)
Kempe, D., Kleinberg, J., Tardos, É.: Influential nodes in a diffusion model for social networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1127–1138. Springer, Heidelberg (2005). https://doi.org/10.1007/11523468_91
Kimura, M., Saito, K.: Tractable models for information diffusion in social networks. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 259–271. Springer, Heidelberg (2006). https://doi.org/10.1007/11871637_27
Even-Dar, E., Shapira, A.: A note on maximizing the spread of influence in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 281–286. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-77105-0_27
Borgs, C., Brautbar, M., Chayes, J., et al.: Maximizing social influence in nearly optimal time. In: 25th ACM-SIAM Symposium on Discrete Algorithms, pp. 946–957. Society for Industrial and Applied Mathematics, USA (2014)
Youze, T., Xiaokui, X., Yanchen, S.: Influence maximization: near-optimal time complexity meets practical efficiency. In: the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD 2014), pp. 75–86. ACM, New York (2014)
Youze, T., Yanchen, S., Xiaokui, X.: Influence maximization in near-linear time: a martingale approach. In: The 2015 ACM SIGMOD International Conference on Management of Data (SIGMOD 2015), pp. 1539–1554. ACM, New York (2015)
Goyal, A., Lu, W., Lakshmanan, L.V.S.: SIMPATH: an efficient algorithm for influence maximization under the linear threshold model. In: 13th International Conference on Data Mining, Vancouver, BC, pp. 211–220. IEEE (2011)
Tang, J., Tang, X., Yuan, J.: Profit maximization for viral marketing in online social networks: algorithms and analysis. IEEE Trans. Knowl. Data Eng. 30(6), 1095–1108 (2018)
Tang, J., Tang, X., Yuan, J.: Towards profit maximization for online social network providers. arXiv:1712.08963 (2017)
Lee, J., Mirrokni, V., Nagarajan, V., Sviridenko, M.: Maximizing nonmonotone sub-modular functions under matroid or knapsack constraints. SIAM J. Disc. Math. 23(4), 2053–2078 (2010)
Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: offline and secretary algorithms. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 246–257. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17572-5_20
Feldman, M., Naor, J., Schwartz, R.: A unified continuous greedy algorithm for submodular maximization. In: 52nd Annual Symposium on Foundations of Computer Science (FOCS 2011), USA, pp. 570–579. IEEE Computer Society (2011)
Wu, W., Zhang, Z., Du, D.Z.: Set function optimization. J. Oper. Res. Soc. China 7(2), 183–193 (2019)
Iyer, R., Bilmes, J.: Algorithms for approximate minimization of the difference between submodular functions, with applications. In: 28th Conference on Uncertainty in Artificial Intelligence (UAI 2012), Arlington, Virginia, pp. 407–417. AUAI Press (2012)
Narasimhan M., Bilmes J.: A submodular-supermodular procedure with applications to discriminative structure learning. In: 21st Conference on Uncertainty in Artificial Intelligence (UAI 2005). arXiv:1207.1404
Bai W., Bilmes J.: Greed is still good: maximizing monotone submodular + supermodular functions. In: Dy, J., Krause, A. (eds.) 35th International Conference on Machine Learning (ICML 2018). LNCS, vol. 80. pp. 304–313. PMLR (2018)
Li, X., Du, H.G., Pardalos, P.M.: A variation of DS decomposition in set function optimization. J. Comb. Opt. 40(1), 36–44 (2020). https://doi.org/10.1007/s10878-020-00560-w
Yang, W., et al.: Marginal gains to maximize content spread in social networks. IEEE Trans. Comput. Soc. Syst. 6(3), 479–490 (2019)
Yang, W., Zhang, Y., Du, D.-Z.: Influence maximization problem: properties and algorithms. J. Comb. Opt. 40(4), 907–928 (2020). https://doi.org/10.1007/s10878-020-00638-5
Erkol, Ş., Castellano, C., Radicchi, F.: Systematic comparison between methods for the detection of influential spreaders in complex networks. Sci. Rep. 9, 15095 (2019). https://doi.org/10.1038/s41598-019-51209-6
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Du, L., Chen, S., Gao, S., Yang, W. (2020). Nonsubmodular Constrained Profit Maximization from Increment Perspective. In: Chellappan, S., Choo, KK.R., Phan, N. (eds) Computational Data and Social Networks. CSoNet 2020. Lecture Notes in Computer Science(), vol 12575. Springer, Cham. https://doi.org/10.1007/978-3-030-66046-8_37
Download citation
DOI: https://doi.org/10.1007/978-3-030-66046-8_37
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-66045-1
Online ISBN: 978-3-030-66046-8
eBook Packages: Computer ScienceComputer Science (R0)