{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:57:47Z","timestamp":1760237867697,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T00:00:00Z","timestamp":1593475200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"The National Key Research and Development Program of China","award":["No. 2018YFC0831703, No. 2017YFB0803303"],"award-info":[{"award-number":["No. 2018YFC0831703, No. 2017YFB0803303"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The recent development of the mobile Internet and the rise of social media have significantly enriched the way people access information. Accurate modeling of the probability of information propagation between users is essential for studying information dissemination issues in social networks. As the dissemination of information is inseparable from the interactions between users, the probability of propagation can be characterized by such interactions. In general, there are differences in the dissemination modes of information that carry different topics in a real social network. Using these factors, we propose a method (TMIVM) to measure the mutual influence between users at the topic level. The method associates two vectorization parameters for each user\u2014an influence vector and a susceptibility vector\u2014where the dimensions of the vector represent different topic categories. The magnitude of the mutual influence between users on different topics can be obtained by the product of the corresponding elements of the vectors. Specifically, in this article, we fit a social network historical information cascade data through Survival Analysis to learn the parameters of the influence and susceptibility vectors. The experimental results on a synthetic data set and a real Microblog data set show that this method better measures the propagation probability and information cascade predictions compared to other methods.<\/jats:p>","DOI":"10.3390\/e22070725","type":"journal-article","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T14:24:24Z","timestamp":1593527064000},"page":"725","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Measurement Model of Mutual Influence for Information Dissemination"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9091-3262","authenticated-orcid":false,"given":"Liang","family":"Zhang","sequence":"first","affiliation":[{"name":"College of Computer, National University of Defense Technology, Changsha 410073, China"}]},{"given":"Yong","family":"Quan","sequence":"additional","affiliation":[{"name":"College of Computer, National University of Defense Technology, Changsha 410073, China"}]},{"given":"Bin","family":"Zhou","sequence":"additional","affiliation":[{"name":"College of Computer, National University of Defense Technology, Changsha 410073, China"}]},{"given":"Yan","family":"Jia","sequence":"additional","affiliation":[{"name":"College of Computer, National University of Defense Technology, Changsha 410073, China"}]},{"given":"Liqun","family":"Gao","sequence":"additional","affiliation":[{"name":"College of Computer, National University of Defense Technology, Changsha 410073, China"}]}],"member":"1968","published-online":{"date-parts":[[2020,6,30]]},"reference":[{"key":"ref_1","first-page":"3092","article-title":"Estimating diffusion networks: Recovery conditions, sample complexity & soft-thresholding algorithm","volume":"17","author":"Song","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., and Tardos, \u00c9. (2003). Maximizing the spread of influence through a social network. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM.","DOI":"10.1145\/956750.956769"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1038\/nature14604","article-title":"Influence maximization in complex networks through optimal percolation","volume":"524","author":"Morone","year":"2015","journal-title":"Nature"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Yang, Z., Guo, J., Cai, K., Tang, J., Li, J., Zhang, L., and Su, Z. (2010). Understanding retweeting behaviors in social networks. Proceedings of the 19th ACM International Conference on Information and Knowledge Management, ACM.","DOI":"10.1145\/1871437.1871691"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Jiang, B., Liang, J., Sha, Y., Li, R., Liu, W., Ma, H., and Wang, L. (2016). Retweeting behavior prediction based on one-class collaborative filtering in social networks. Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval, ACM.","DOI":"10.1145\/2911451.2914713"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"14207","DOI":"10.1073\/pnas.1606316113","article-title":"Accurate and scalable social recommendation using mixed-membership stochastic block models","volume":"113","author":"Moore","year":"2016","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Wang, X., Lu, W., Ester, M., Wang, C., and Chen, C. (2016). Social recommendation with strong and weak ties. Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, ACM.","DOI":"10.1145\/2983323.2983701"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"814","DOI":"10.14778\/2752939.2752950","article-title":"Viral marketing meets social advertising","volume":"8","author":"Aslay","year":"2015","journal-title":"Proc. VLDB Endow."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1109\/TNET.2017.2691544","article-title":"A Billion-Scale Approximation Algorithm for Maximizing Benefit in Viral Marketing","volume":"25","author":"Nguyen","year":"2017","journal-title":"IEEE ACM Trans. Netw."},{"key":"ref_10","unstructured":"Java, A., Kolari, P., Finin, T., and Oates, T. (2006, January 22\u201326). Modeling the spread of influence on the blogosphere. UMBC TR-CS-06-03. Proceedings of the 15th International World Wide Web Conference, Edinburgh, UK."},{"key":"ref_11","unstructured":"Du, N., Song, L., Woo, H., and Zha, H. (May, January 29). Uncover topic-sensitive information diffusion networks. Proceedings of the Artificial Intelligence and Statistics, Scottsdale, AZ, USA."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Yang, J., and Leskovec, J. (2010). Modeling information diffusion in implicit networks. Proceedings of the 2010 IEEE International Conference on Data Mining, IEEE.","DOI":"10.1109\/ICDM.2010.22"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Saito, K., Nakano, R., and Kimura, M. (2008). Prediction of information diffusion probabilities for independent cascade model. Proceedings of the International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, Springer.","DOI":"10.1007\/978-3-540-85567-5_9"},{"key":"ref_14","unstructured":"Yoav, A., Pantel, P., and Gamon, M. (2012). Predicting responses to microblog posts. Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Association for Computational Linguistics."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2103","DOI":"10.1016\/j.physleta.2012.05.021","article-title":"An information diffusion model based on retweeting mechanism for online social media","volume":"376","author":"Xiong","year":"2012","journal-title":"Phys. Lett. A"},{"key":"ref_16","unstructured":"Myers, S.A., and Leskovec, J. (2010, January 6\u201311). On the convexity of latent social network inference. Proceedings of the Advances in Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Rodriguez, M.G., Leskovec, J., and Krause, A. (2010). Inferring networks of diffusion and influence. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM.","DOI":"10.1145\/1835804.1835933"},{"key":"ref_18","unstructured":"Rodriguez, M.G., Balduzzi, D., and Sch\u00f6lkopf, B. (July, January 28). Uncovering the Temporal Dynamics of Diffusion Networks. Proceedings of the 28th International Conference on Machine Learning (ICML 2011), International Machine Learning Society, Bellevue, DC, USA."},{"key":"ref_19","unstructured":"Rodriguez, M.G., Leskovec, J., and Schoelkopf, B. (June, January 16). Modeling information propagation with survival theory. Proceedings of the International Conference on Machine Learning, Atlanta, GA, USA."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Wang, Y., Shen, H., Liu, S., and Cheng, X. (2015, January 25\u201330). Learning user-specific latent influence and susceptibility from information cascades. Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, Austin, TX, USA.","DOI":"10.1609\/aaai.v29i1.9213"},{"key":"ref_21","unstructured":"Lawless, J.F. (2011). Statistical Models and Methods for Lifetime Data, John Wiley & Sons."},{"key":"ref_22","unstructured":"Horn, R.A., and Johnson, C.R. (1990). Matrix Analysis, Cambridge University Press."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Liu, S., Zheng, H., Shen, H., Cheng, X., and Liao, X. (2017, January 19\u201325). Learning Concise Representations of Users\u2019 Influences through Online Behaviors. Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, Melbourne, Australia.","DOI":"10.24963\/ijcai.2017\/327"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","article-title":"Projected Gradient Methods for Nonnegative Matrix Factorization","volume":"19","author":"Lin","year":"2007","journal-title":"Neural Comput."},{"key":"ref_25","first-page":"993","article-title":"Latent dirichlet allocation","volume":"3","author":"Blei","year":"2003","journal-title":"J. Mach. Learn. Res."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/7\/725\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:45:25Z","timestamp":1760175925000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/7\/725"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,30]]},"references-count":25,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2020,7]]}},"alternative-id":["e22070725"],"URL":"https:\/\/doi.org\/10.3390\/e22070725","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2020,6,30]]}}}