Jingya Zhou
ABSTRACT
Influence Maximization (IM) has been extensively applied to many fields, and the viral marketing in today's online social networks (OSNs) is one of the most famous applications, where a group of seed users are selected to activate more users in a distributed cascading fashion. Many prior work explore the IM problem based on the assumption of given budget. However, the budget assumption does not hold in many practical scenarios, since companies might have no sufficient prior knowledge about the market. Moreover, companies prefer a moderately controllable viral marketing that allows them to adjust marketing decision according to the market reaction. In this paper, we propose a new problem, called Controllable social influence maximization (Cosin), to find a set of seed users inside a controllable scope to maximize the benefit given an expected return on investment (ROI). Like the IM problem, the Cosin problem is also NP-hard. We present a distributed multi-hop based framework for the influence estimation, and design a (1/2 + ϵ)-approximate algorithm based on the proposed framework. Moreover, we further present a distributed implementation to accelerate the execution of algorithm for large-scale social networks. Extensive experiments with a billion-scale social network indicate that the proposed algorithms outperform state-of-the-art algorithms in both benefit and running time.
- Niv Buchbinder, Moran Feldman, Joseph Naor, and Roy Schwartz. 2015. A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44, 5 (2015), 1384--1402.Google Scholar
Cross Ref
- Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, and Roy Schwartz. 2012. A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular maximization. In Proceedings of IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). 392--403. Google ScholarDigital Library
- Wei Chen, Wei Lu, and Ning Zhang. 2012. Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process. In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence. Google ScholarDigital Library
- Wei Chen, Chi Wang, and Yajun Wang. 2010. Scalable influence maximization for prevalent viral marketing in large-scale social networks. In Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1029--1038. Google ScholarDigital Library
- Wei Chen, Yajun Wang, and Siyu Yang. 2009. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 199--208. Google ScholarDigital Library
- David Kempe, Jon M. Kleinberg, and Éva Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 137--146. Google ScholarDigital Library
- Haewoon Kwak, Changhyun Lee, Hosung Park, and Sue B. Moon. 2010. What is Twitter, a social network or a news media?. In Proceedings of the 19th International Conference on World Wide Web, WWW. 591--600. Google ScholarDigital Library
- Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne M. VanBriesen, and Natalie S. Glance. 2007. Cost-effective outbreak detection in networks. In Proceedings of the 13rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 420--429. Google ScholarDigital Library
- Ji Li, Zhipeng Cai, Mingyuan Yan, and Yingshu Li. 2016. Using crowdsourced data in location-based social networks to explore influence maximization. In Proceedings of IEEE Conference on Computer Communications, INFOCOM. 1--9.Google Scholar
- Xiang Li, J. David Smith, Thang N. Dinh, and My T. Thai. 2017. Why approximate when you can get the exact? Optimal targeted viral marketing at scale. In Proceedings of IEEE Conference on Computer Communications, INFOCOM. 1--9.Google Scholar
- Bo Liu, Gao Cong, Dong Xu, and Yifeng Zeng. 2012. Time Constrained Influence Maximization in Social Networks. In Proceedings of 12th IEEE International Conference on Data Mining, ICDM. 439--448. Google ScholarDigital Library
- Huy Nguyen and Rong Zheng. 2013. On Budgeted Influence Maximization in Social Networks. IEEE J. Select. Areas Commun. 31, 6 (2013), 1084--1094.Google ScholarCross Ref
- Hung T. Nguyen, Thang N. Dinh, and My T. Thai. 2016. Cost-aware Targeted Viral Marketing in billion-scale networks. In Proceedings of 35th IEEE International Conference on Computer Communications, INFOCOM. 1--9.Google Scholar
- Hung T. Nguyen, My T. Thai, and Thang N. Dinh. 2016. Stop-and-Stare: Optimal Sampling Algorithms for Viral Marketing in Billion-scale Networks. In Proceedings of the 2016 International Conference on Management of Data, SIGMOD. 695--710. Google ScholarDigital Library
- Xinghao Pan, Stefanie Jegelka, Joseph E. Gonzalez, Joseph K. Bradley, and Michael I. Jordan. 2014. Parallel Double Greedy Submodular Maximization. In Proceedings of Annual Conference on Neural Information Processing Systems, NIPS. 118--126. Google ScholarDigital Library
- Jin Tang, Xueyan Tang, and Junsong Yuan. 2017. Influence Maximization Meets Efficiency and Effectiveness: A Hop-Based Approach. In Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. 64--71. Google ScholarDigital Library
- Jin Tang, Xueyan Tang, and Junsong Yuan. 2018. Towards Profit Maximization for Online Social Network Providers. In Proceedings of IEEE International Conference on Computer Communications, INFOCOM. 1--9.Google ScholarDigital Library
- Youze Tang, Yanchen Shi, and Xiaokui Xiao. 2015. Influence Maximization in Near-Linear Time: A Martingale Approach. In Proceedings of the 2015 International Conference on Management of Data, SIGMOD. 1539--1554. Google ScholarDigital Library
- Yu Ting Wen, Po-Ruey Lei, Wen-Chih Peng, and Xiaofang Zhou. 2014. Exploring Social Influence on Location-Based Social Networks. In Proceedings of 14th IEEE International Conference on Data Mining, ICDM. 1043--1048. Google ScholarDigital Library
- Daniel Yue Zhang, Dong Wang, and Yang Zhang. 2017. Constraint-aware dynamic truth discovery in big data social media sensing. In 2017 IEEE International Conference on Big Data, BigData. 57--66.Google ScholarCross Ref
- Jingya Zhou and Jianxi Fan. 2017. JPR: Exploring Joint Partitioning and Replication for Traffic Minimization in Online Social Networks. In Proceedings of 37th IEEE International Conference on Distributed Computing Systems, ICDCS. 1147--1156.Google ScholarCross Ref
- Jingya Zhou and Jianxi Fan. 2019. TransLink: User Identity Linkage across Heterogeneous Social Networks via Translating Embeddings. In Proceedings of 38th IEEE International Conference on Computer Communications, INFOCOM. 1--9.Google ScholarDigital Library
- Tao Zhou, Jiuxin Cao, Bo Liu, Shuai Xu, Ziqing Zhu, and Junzhou Luo. 2015. Location-Based Influence Maximization in Social Networks. In Proceedings of the 24th ACM International Conference on Information and Knowledge Management, CIKM. 1211--1220. Google ScholarDigital Library
- Yuqing Zhu, Deying Li, and Zhao Zhang. 2016. Minimum cost seed set for competitive social influence. In Proceedings of IEEE International Conference on Computer Communications, INFOCOM. 1--9.Google ScholarDigital Library
- Yuqing Zhu, Zaixin Lu, Yuanjun Bi, Weili Wu, Yiwei Jiang, and Deying Li. 2013. Influence and Profit: Two Sides of the Coin. In Proceedings of IEEE 13rd IEEE International Conference on Data Mining, ICDM. 1301--1306.Google ScholarCross Ref
Index Terms
- Cosin: Controllable Social Influence Maximization and Its Distributed Implementation in Large-scale Social Networks
Recommendations
Discovering Homophily in Online Social Networks
During the last ten years, Online Social Networks (OSNs) have increased their popularity by becoming part of the real life of users. Despite their tremendous widespread, OSNs have introduced several privacy issues as a consequence of the nature of the ...
Influence Maximization Problem for Unknown Social Networks
ASONAM '15: Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2015We propose a novel problem called influence maximization for unknown graphs, and propose a heuristic algorithm for the problem. Influence maximization is the problem of detecting a set of influential nodes in a social network, which represents social ...
Topic-constrained influence maximization in social networks
ICCIP '17: Proceedings of the 3rd International Conference on Communication and Information ProcessingUnderstanding the spread of influence and maximizing it through online social networks lead to gain a lot of benefits for various practical applications such as viral marketing, personalized recommendation, cascade detection, and information monitoring. ...
Comments