Abstract
With the popularity of OSNs, finding a set of most influential users (or nodes) so as to trigger the largest influence cascade is of significance. For example, companies may take advantage of the “word-of-mouth” effect to trigger a large cascade of purchases by offering free samples/discounts to those most influential users. This task is usually modeled as an influence maximization problem, and it has been widely studied in the past decade. However, considering that users in OSNs may participate in various kinds of online activities, e.g., giving ratings to products, joining discussion groups, etc., influence diffusion through online activities becomes even more significant.
In this paper, we study the impact of online activities by formulating the influence maximization problem for social-activity networks (SANs) containing both users and online activities. To address the computation challenge, we define an influence centrality via random walks to measure influence, then use the Monte Carlo framework to efficiently estimate the centrality in SANs. Furthermore, we develop a greedy-based algorithm with two novel optimization techniques to find the most influential users. By conducting extensive experiments with real-world datasets, we show our approach is more efficient than the state-of-the-art algorithm IMM [17] when we needs to handle large amount of online activities.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Yelp Dataset. https://www.yelp.com/dataset_challenge/dataset
Barbieri, N., Bonchi, F., Manco, G.: Topic-aware social influence propagation models. In: Proceedings of ICDM (2012)
Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of SODA (2014)
Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of ACM KDD (2010)
Chen, W., Wang, Y., Yang, S.: efficient influence maximization in social networks. In: Proceedings of ACM KDD (2009)
Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: Proceedings of IEEE ICDM (2010)
Everett, M.G., Borgatti, S.P.: The centrality of groups and classes. J. Math. Sociol. 23(3), 181–201 (1999)
Freeman, L.C.: Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215–239 (1979)
Galhotra, S., Arora, A., Roy, S.: Holistic influence maximization: Combining scalability and efficiency with opinion-aware models. arXiv preprint arXiv:1602.03110 (2016)
Hoeffding, W.: Probability inequalities for sums of bounded random variables. J. Am. Stat. Assoc. 58(301), 13–30 (1963)
Jamali, M., Ester, M.: A matrix factorization technique with trust propagation for recommendation in social networks. In: Proceedings of ACM RecSys (2010)
Kempe, D., Kleinberg, J., Tardos, É.: Maximizing the spread of influence through a social network. In: Proceedings of ACM KDD (2003)
Kusumoto, M., Maehara, T., Kawarabayashi, K.-I.: Scalable similarity search for SimRank. In: Proceedings of ACM SIGMOD (2014)
Lin, Y., Lui, J.C.: Analyzing competitive influence maximization problems with partial information: an approximation algorithmic framework. Perform. Eval. 91, 187–204 (2015)
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank Citation Ranking: Bringing Order to The Web. Technical report (1999)
Tang, J., Gao, H., Liu, H.: mTrust: discerning multi-faceted trust in a connected world. In: Proceedings of ACM WSDM (2012)
Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time: a martingale approach. In: Proceedings of ACM SIGMOD (2015)
Tang, Y., Xiao, X., Shi, Y.: Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of ACM SIGMOD (2014)
Zhao, J., Lui, J., Towsley, D., Guan, X.: Measuring and maximizing group closeness centrality over disk-resident graphs. In: Proceedings of SIMPLEX (2014)
Zhao, J., Lui, J., Towsley, D., Wang, P., Guan, X.: A tale of three graphs: sampling design on hybrid social-affiliation networks. In: Proceedings of IEEE ICDE (2015)
Zhao, P., Li, Y., Xie, H., Wu, Z., Xu, Y., Lui, J.C.S.: Measuring and Maximizing Influence via Random Walk in Social Activity Networks, Technical report. https://arxiv.org/abs/1602.03966
Acknowledgements
This work was supported by National Nature Science Foundation of China (61303048 and 61379038), and Anhui Provincial Natural Science Foundation (1508085SQF214).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Zhao, P., Li, Y., Xie, H., Wu, Z., Xu, Y., Lui, J.C.S. (2017). Measuring and Maximizing Influence via Random Walk in Social Activity Networks. In: Candan, S., Chen, L., Pedersen, T., Chang, L., Hua, W. (eds) Database Systems for Advanced Applications. DASFAA 2017. Lecture Notes in Computer Science(), vol 10178. Springer, Cham. https://doi.org/10.1007/978-3-319-55699-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-55699-4_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55698-7
Online ISBN: 978-3-319-55699-4
eBook Packages: Computer ScienceComputer Science (R0)