{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:01:46Z","timestamp":1768341706354,"version":"3.49.0"},"reference-count":54,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["NHM"],"published-print":{"date-parts":[[2023]]},"abstract":"<abstract><p>Influence maximization (IM), a central issue in optimizing information diffusion on social platforms, aims to spread posts or comments more widely, rapidly, and efficiently. Existing studies primarily focus on the positive effects of incorporating heuristic calculations in IM approaches. However, heuristic models fail to consider the potential enhancements that can be achieved through network representation learning techniques. Some recent work is keen to use representation learning to deal with IM issues. However, few in-depth studies have explored the existing challenges in IM representation learning, specifically regarding the role characteristics and role representations. This paper highlights the potential advantages of combining heuristic computing and role embedding to solve IM problems. First, the method introduces role granularity classification to effectively categorize users into three distinct roles: opinion leaders, structural holes and normal nodes. This classification enables a deeper understanding of the dynamics of users within the network. Second, a novel role-based network embedding (RbNE) algorithm is proposed. By leveraging the concept of node roles, RbNE captures the similarity between nodes, allowing for a more accurate representation of the network structure. Finally, a superior IM approach, named RbneIM, is recommended. RbneIM combines heuristic computing and role embedding to establish a fusion-enhanced IM solution, resulting in an improved influence analysis process. Exploratory outcomes on six social network datasets indicate that the proposed approach outperforms state-of-the-art seeding algorithms in terms of maximizing influence. This finding highlights the effectiveness and efficacy of the proposed method in achieving higher levels of influence within social networks. The code is available at <ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/github.com\/baiyazi\/IM2\">https:\/\/github.com\/baiyazi\/IM2<\/ext-link>.<\/p><\/abstract><\/jats:p>","DOI":"10.3934\/nhm.2023068","type":"journal-article","created":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T10:50:53Z","timestamp":1689850253000},"page":"1539-1574","source":"Crossref","is-referenced-by-count":5,"title":["Influence maximization in social networks using role-based embedding"],"prefix":"10.3934","volume":"18","author":[{"given":"Xu","family":"Gu","sequence":"first","affiliation":[{"name":"School of Computer and Software Engineering, Xihua University, Chengdu, 610039, China"}]},{"given":"Zhibin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer and Software Engineering, Xihua University, Chengdu, 610039, China"}]},{"given":"Xiaoliang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Computer and Software Engineering, Xihua University, Chengdu, 610039, China"},{"name":"Department of Computer Science and Operations Research, University of Montreal, Montreal, QC H3C3J7, Canada"}]},{"given":"Peng","family":"Lu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Operations Research, University of Montreal, Montreal, QC H3C3J7, Canada"}]},{"given":"Yajun","family":"Du","sequence":"additional","affiliation":[{"name":"School of Computer and Software Engineering, Xihua University, Chengdu, 610039, China"}]},{"given":"Mingwei","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Computer and Software Engineering, Xihua University, Chengdu, 610039, China"}]}],"member":"2321","reference":[{"key":"key-10.3934\/nhm.2023068-1","doi-asserted-by":"publisher","unstructured":"J. Gu, G. Li, N. D. Vo, J. J. Jung, Contextual Word2Vec model for understanding chinese out of vocabularies on online social media, Int. J. Semant. Web. Inf. Syst.<\/i>, 18<\/b> (2022), 1\u201314. https:\/\/doi.org\/10.4018\/ijswis.309428","DOI":"10.4018\/ijswis.309428"},{"key":"key-10.3934\/nhm.2023068-2","unstructured":"G. Manal, Social media data for the conservation of historic urban landscapes: Prospects and challenges, in Culture and Computing. Design Thinking and Cultural Computing<\/i> (eds. M. Rauterberg), Springer, (2021), 209\u2013223. https:\/\/doi.org\/10.1007\/978-3-030-77431-8_13<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-3","unstructured":"J. Zhao, L. Yang, X. Yang, Maximum profit of viral marketing: An optimal control approach, in Proceedings of the 2019 4th International Conference on Mathematics and Artificial Intelligence<\/i>, Association for Computing Machinery, (2019), 209\u2013214. https:\/\/doi.org\/10.1145\/3325730.3325767<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-4","doi-asserted-by":"crossref","unstructured":"D. Pedro, R. Matt, Mining the network value of customers, in Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining<\/i>, Association for Computing Machinery, (2001), 57\u201366. https:\/\/doi.org\/10.1145\/502512.502525<\/ext-link>","DOI":"10.1145\/502512.502525"},{"key":"key-10.3934\/nhm.2023068-5","unstructured":"X. Song, B. L. Tseng, C. Lin, M. Sun, Personalized recommendation driven by information flow, in Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval<\/i>, Association for Computing Machinery, (2006), 509\u2013516. https:\/\/doi.org\/10.1145\/1148170.1148258<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-6","doi-asserted-by":"publisher","unstructured":"Y. Li, D. Zhang, K. Tan, Real-time targeted influence maximization for online advertisements, Proc. VLDB Endow.<\/i>, 8<\/b> (2015), 1070\u20131081. https:\/\/doi.org\/10.14778\/2794367.2794376","DOI":"10.14778\/2794367.2794376"},{"key":"key-10.3934\/nhm.2023068-7","unstructured":"L. Simone, M. Diego, R. Giuseppe, M. Maurizio, Mining micro-influencers from social media posts, in Proceedings of the 35th Annual ACM Symposium on Applied Computing<\/i>, Association for Computing Machinery, (2020), 867\u2013874. https:\/\/doi.org\/10.1145\/3341105.3373954<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-8","doi-asserted-by":"publisher","unstructured":"X. Zhou, S. Li, Z. Li, W. Li, Information diffusion across cyber-physical-social systems in smart city: a survey, Neurocomputing<\/i>, 444<\/b> (2021), 203\u2013213. https:\/\/doi.org\/10.1016\/j.neucom.2020.08.089","DOI":"10.1016\/j.neucom.2020.08.089"},{"key":"key-10.3934\/nhm.2023068-9","doi-asserted-by":"publisher","unstructured":"V. Soroush, M. Mostafa, R. Deb, Rumor gauge: predicting the veracity of rumors on Twitter, ACM Trans. Knowl. Discov. Data<\/i>, 11<\/b> (2017), 1\u201336. https:\/\/doi.org\/10.1145\/3070644","DOI":"10.1145\/3070644"},{"key":"key-10.3934\/nhm.2023068-10","doi-asserted-by":"publisher","unstructured":"S. R. Sahoo, B. B. Gupta, Multiple features based approach for automatic fake news detection on social networks using deep learning, Appl. Soft Comput.<\/i>, 100<\/b> (2021), 106983. https:\/\/doi.org\/10.1016\/j.asoc.2020.106983","DOI":"10.1016\/j.asoc.2020.106983"},{"key":"key-10.3934\/nhm.2023068-11","doi-asserted-by":"crossref","unstructured":"D. Kempe, J. Kleinberg, E. Tardos, Maximizing the spread of influence through a social network, in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining<\/i>, Association for Computing Machinery, (2003), 137\u2013146. https:\/\/doi.org\/10.1145\/956750.956769<\/ext-link>","DOI":"10.1145\/956750.956769"},{"key":"key-10.3934\/nhm.2023068-12","doi-asserted-by":"publisher","unstructured":"A. G. Cecilia, B. Manuel, T. M. Valentina, An agent-based social simulation for citizenship competences and conflict resolution styles, Int. J. Semant. Web Inf. Syst.<\/i>, 18<\/b> (2022), 1\u201323. https:\/\/doi.org\/10.4018\/IJSWIS.306749","DOI":"10.4018\/IJSWIS.306749"},{"key":"key-10.3934\/nhm.2023068-13","unstructured":"Y. Rong, Q. Zhu, H. Cheng, A model-free approach to infer the diffusion network from event cascade, in Proceedings of the 25th ACM International on Conference on Information and Knowledge Management<\/i>, Association for Computing Machinery, (2016), 1653\u20131662. https:\/\/doi.org\/10.1145\/2983323.2983718<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-14","doi-asserted-by":"crossref","unstructured":"S. Galhotra, A. Arora, S. Virinchi, S. Roy, Asim: A scalable algorithm for influence maximization under the independent cascade model, in Proceedings of the 24th International Conference on World Wide Web<\/i>, Association for Computing Machinery, (2015), 35\u201336. https:\/\/doi.org\/10.1145\/2740908.2742725<\/ext-link>","DOI":"10.1145\/2740908.2742725"},{"key":"key-10.3934\/nhm.2023068-15","doi-asserted-by":"publisher","unstructured":"A. Cetto, M. Klier, A. Richter, J. F. Zolitschka, \"Thanks for sharing\"\u2014Identifying users' roles based on knowledge contribution in Enterprise Social Networks, Comput. Net.<\/i>, 135<\/b> (2018), 275\u2013288. https:\/\/doi.org\/10.1016\/j.comnet.2018.02.012","DOI":"10.1016\/j.comnet.2018.02.012"},{"key":"key-10.3934\/nhm.2023068-16","doi-asserted-by":"publisher","unstructured":"L. Sopjani, J. J. Stier, S. Ritz\u00e9n, M. Hesselgren, P. Geor\u00e9n, Involving users and user roles in the transition to sustainable mobility systems: The case of light electric vehicle sharing in Sweden, Transp. Res. Part D: Transp. Environ.<\/i>, 71<\/b> (2019), 207\u2013221. https:\/\/doi.org\/10.1016\/j.trd.2018.12.011","DOI":"10.1016\/j.trd.2018.12.011"},{"key":"key-10.3934\/nhm.2023068-17","doi-asserted-by":"publisher","unstructured":"L. B. Jeppesen, K. Laursen, The role of lead users in knowledge sharing, Res. Policy<\/i>, 38<\/b> (2009), 1582\u20131589. https:\/\/doi.org\/10.1016\/j.respol.2009.09.002","DOI":"10.1016\/j.respol.2009.09.002"},{"key":"key-10.3934\/nhm.2023068-18","doi-asserted-by":"publisher","unstructured":"I. Singh, N. Kumar, S. K. G., T. Sharma, V. Kumar, S. Singhal, Database intrusion detection using role and user behavior based risk assessment, J. Inf. Secur. Appl.<\/i>, 55<\/b> (2020), 102654. https:\/\/doi.org\/10.1016\/j.jisa.2020.102654","DOI":"10.1016\/j.jisa.2020.102654"},{"key":"key-10.3934\/nhm.2023068-19","doi-asserted-by":"crossref","unstructured":"D. Kempe, J. M. Kleinberg, E. Tardos, Maximizing the spread of influence through a social network, in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining<\/i>, Association for Computing Machinery, (2003), 137\u2013146. https:\/\/doi.org\/10.1145\/956750.956769<\/ext-link>","DOI":"10.1145\/956750.956769"},{"key":"key-10.3934\/nhm.2023068-20","unstructured":"P. Shakarian, A. Bhatnagar, A. Aleali, E. Shaabani, R. Guo, The independent cascade and linear threshold models, in Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining<\/i>, Association for Computing Machinery, (2015), 177\u2013184. https:\/\/doi.org\/10.1007\/978-3-319-23105-1_4<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-21","doi-asserted-by":"crossref","unstructured":"M. Richardson, P. Domingos, Mining knowledge-sharing sites for viral marketing, in Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining<\/i>, Association for Computing Machinery, (2002), 61\u201370. https:\/\/doi.org\/10.1145\/775047.775057<\/ext-link>","DOI":"10.1145\/775047.775057"},{"key":"key-10.3934\/nhm.2023068-22","doi-asserted-by":"crossref","unstructured":"D. Oriedi, C. de Runz, Z. Guessoum, A. A. Nyongesa, Influence maximization through user interaction modeling, in Proceedings of the 35th Annual ACM Symposium on Applied Computing<\/i>, Association for Computing Machinery, (2020), 1888\u20131890. https:\/\/doi.org\/10.1145\/3386901.3388999<\/ext-link>","DOI":"10.1145\/3341105.3374080"},{"key":"key-10.3934\/nhm.2023068-23","unstructured":"L. Sun, A. Chen, P. S. Yu, W. Chen, Influence maximization with spontaneous user adoption, in Proceedings of the 13th International Conference on Web Search and Data Mining<\/i>, Association for Computing Machinery, (2020), 573\u2013581. https:\/\/doi.org\/10.1145\/3336191.3371785<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-24","doi-asserted-by":"publisher","unstructured":"J. Guo, W. Wu, Adaptive influence maximization: if influential node unwilling to be the seed, ACM Trans. Knowl. Discov. Data<\/i>, 15<\/b> (2021), 1\u201323. https:\/\/doi.org\/10.1145\/3447396","DOI":"10.1145\/3447396"},{"key":"key-10.3934\/nhm.2023068-25","unstructured":"J. Luo, X. Liu, X. Kong, Competitive opinion maximization in social networks, in Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining<\/i>, Association for Computing Machinery, (2019), 250\u2013257. https:\/\/doi.org\/10.1145\/3341161.3342899<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-26","unstructured":"Y. Zhang, Y. Zhang, Top-K influential nodes in social networks: A game perspective, in Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval<\/i>, Association for Computing Machinery, (2017), 1029\u20131032. https:\/\/doi.org\/10.1145\/3077136.3080709<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-27","unstructured":"X. Liu, X. Kong, P. S. Yu, Active ppinion maximization in social networks, Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining<\/i>, Association for Computing Machinery, (2018), 1840\u20131849. https:\/\/doi.org\/10.1145\/3219819.3220061<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-28","unstructured":"P. Banerjee, W. Chen, L. V.S. Lakshmanan, Maximizing welfare in social networks under a utility driven influence diffusion model, in Proceedings of the 2019 International Conference on Management of Data<\/i>, Association for Computing Machinery, (2019), 1078\u20131095. https:\/\/doi.org\/10.1145\/3299869.3319879<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-29","doi-asserted-by":"publisher","unstructured":"M. M. Keikha, M. Rahgozar, M. Asadpour, M. F. Abdollahi, Influence maximization across heterogeneous interconnected networks based on deep learning, Expert Syst. Appl.<\/i>, 140<\/b> (2020). https:\/\/doi.org\/10.1016\/j.eswa.2019.112905","DOI":"10.1016\/j.eswa.2019.112905"},{"key":"key-10.3934\/nhm.2023068-30","doi-asserted-by":"publisher","unstructured":"Q. Zhan, W. Zhuo, Y. Liu, Social influence maximization for public health campaigns, IEEE Access<\/i>, 7<\/b> (2019), 151252\u2013151260. https:\/\/doi.org\/10.1109\/ACCESS.2019.2946391","DOI":"10.1109\/ACCESS.2019.2946391"},{"key":"key-10.3934\/nhm.2023068-31","doi-asserted-by":"publisher","unstructured":"S. Tian, S. Mo, L. Wang, Z. Peng, Deep reinforcement learning-based approach to tackle topic-aware influence maximization, Data Sci. Engineer.<\/i>, 5<\/b> (2020), 1\u201311. https:\/\/doi.org\/10.1007\/s41019-020-00117-1","DOI":"10.1007\/s41019-020-00117-1"},{"key":"key-10.3934\/nhm.2023068-32","unstructured":"D. Li, J. Liu, J. Jeon, S. Hong, T. Le, D. Lee, et al., Large-scale data-rriven airline market influence maximization, in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining<\/i>, Association for Computing Machinery, (2021), 914\u2013924. https:\/\/doi.org\/10.1145\/3447548.3467365<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-33","doi-asserted-by":"publisher","unstructured":"C. Zhang, W. Li, D. Wei, Y. Liu, Z. Li, Network dynamic GCN influence maximization algorithm with leader fake labeling mechanism, IEEE Trans. Comput. Soc. Syst.<\/i>, (2022), 1\u20139. https:\/\/doi.org\/10.1109\/TCSS.2022.3193583","DOI":"10.1109\/TCSS.2022.3193583"},{"key":"key-10.3934\/nhm.2023068-34","doi-asserted-by":"publisher","unstructured":"W. Li, Z. Li, A. M. Luvembe, C. Yang, Influence maximization algorithm based on Gaussian propagation model, Inf. Sci.<\/i>, 568<\/b> (2021), 386\u2013402. https:\/\/doi.org\/10.1016\/j.ins.2021.04.061","DOI":"10.1016\/j.ins.2021.04.061"},{"key":"key-10.3934\/nhm.2023068-35","doi-asserted-by":"publisher","unstructured":"W. Li, Y. Li, W. Liu, C. Wang, An influence maximization method based on crowd emotion under an emotion-based attribute social network, Inf. Process. Manage.<\/i>, 59<\/b> (2022), 102818. https:\/\/doi.org\/10.1016\/j.ipm.2021.102818","DOI":"10.1016\/j.ipm.2021.102818"},{"key":"key-10.3934\/nhm.2023068-36","doi-asserted-by":"publisher","unstructured":"W. Li, Y. Hu, C. Jiang, S. Wu, Q. Bai, E. M. K. Lai, ABEM: an adaptive agent-based evolutionary approach for influence maximization in dynamic social networks, Appl. Soft Comput.<\/i>, 136<\/b> (2023), 110062. https:\/\/doi.org\/10.1016\/j.asoc.2023.110062","DOI":"10.1016\/j.asoc.2023.110062"},{"key":"key-10.3934\/nhm.2023068-37","doi-asserted-by":"publisher","unstructured":"H. Cai, V. W. Zheng, K. C. Chang, A comprehensive survey of graph embedding: Problems, techniques, and applications, IEEE Trans. Knowl. Data Engineer.<\/i>, 30<\/b> (2018), 1616\u20131637. https:\/\/doi.org\/10.1109\/TKDE.2018.2807452","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"key-10.3934\/nhm.2023068-38","doi-asserted-by":"crossref","unstructured":"B. Perozzi, R. Al-Rfou, S. Skiena, Deepwalk: online learning of social representations, in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining<\/i>, Association for Computing Machinery, (2014), 701\u2013710. https:\/\/doi.org\/10.1145\/2623330.2623732<\/ext-link>","DOI":"10.1145\/2623330.2623732"},{"key":"key-10.3934\/nhm.2023068-39","unstructured":"J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, Q. Mei, Line: large-scale information network embedding, in Proceedings of the 24th international conference on World Wide Web<\/i>, Association for Computing Machinery, (2015), 1067\u20131077. https:\/\/doi.org\/10.1145\/2736277.2741093<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-40","unstructured":"A. Grover, J. Leskovec, node2vec: scalable feature learning for networks, in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining<\/i>, Association for Computing Machinery, (2016), 855\u2013864. https:\/\/doi.org\/10.1145\/2939672.2939754<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-41","unstructured":"C. McCormick, Word2vec tutorial-the skip-gram model, 2016. Available from: http:\/\/mccormickml.com\/2016\/04\/19\/word2vec-tutorial-the-skip-gram-model<\/ext-link>."},{"key":"key-10.3934\/nhm.2023068-42","doi-asserted-by":"publisher","unstructured":"M. M. Keikha, M. Rahgozar, M. Asadpour, Community aware random walk for network embedding, Knowledge-Based Syst.<\/i>, 148<\/b> (2018), 47\u201354. https:\/\/doi.org\/10.1016\/j.knosys.2018.02.028","DOI":"10.1016\/j.knosys.2018.02.028"},{"key":"key-10.3934\/nhm.2023068-43","unstructured":"T. Lou, J. Tang, Mining structural hole spanners through information diffusion in social networks, in Proceedings of the 22nd international conference on World Wide Web<\/i>, Association for Computing Machinery, (2013), 825\u2013836. https:\/\/doi.org\/10.1145\/2488388.2488461<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-44","doi-asserted-by":"publisher","unstructured":"R. S. Burt, Structural holes and good ideas, Am. J. Soc.<\/i>, 110<\/b> (2004), 349\u2013399. https:\/\/doi.org\/10.1086\/421787","DOI":"10.1086\/421787"},{"key":"key-10.3934\/nhm.2023068-45","unstructured":"S. Wu, J. M. Hofman, W. A. Mason, D. J. Watts, Who says what to whom on Twitter, in Proceedings of the 20th International Conference on World Wide Web, WWW 2011<\/i>, Association for Computing Machinery, (2011). https:\/\/doi.org\/10.1145\/1963405.1963504<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-46","unstructured":"T. Mikolov, K. Chen, G. Corrado, J. Dean, Efficient estimation of word representations in vector space, 2013. Available from: http:\/\/arXiv.org\/abs\/1301.3781<\/ext-link>."},{"key":"key-10.3934\/nhm.2023068-47","doi-asserted-by":"publisher","unstructured":"D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, S. M. Dawson, The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations, Behav. Ecol. Soc.<\/i>, 54<\/b> (2003), 396\u2013405. https:\/\/doi.org\/10.1007\/s00265-003-0651-y","DOI":"10.1007\/s00265-003-0651-y"},{"key":"key-10.3934\/nhm.2023068-48","doi-asserted-by":"crossref","unstructured":"A. L. Traud, P. J. Mucha, M. A. Porter, Social structure of Facebook networks, Phys. A<\/i>, 391<\/b> (2012), 4165\u20134180. https:\/\/arXiv.org\/1102.2166","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"key-10.3934\/nhm.2023068-49","doi-asserted-by":"crossref","unstructured":"M. J. Newman, Finding community structure in networks using the eigenvectors of matrices, Phys. Rev. E<\/i>, 74<\/b> (2006), 036104. https:\/\/arXiv.org\/abs\/physics\/0605087v3","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"key-10.3934\/nhm.2023068-50","doi-asserted-by":"publisher","unstructured":"J. Leskovec, J. Kleinberg, C. Faloutsos, Graph evolution: Densification and shrinking diameters, ACM Trans. Knowl. Discovery Data<\/i>, 1<\/b> (2007). https:\/\/doi.org\/10.1145\/1217299.1217301","DOI":"10.1145\/1217299.1217301"},{"key":"key-10.3934\/nhm.2023068-51","unstructured":"B. Rozemberczki, R. Davies, R. Sarkar, C. Sutton, Gemsec: graph embedding with self clustering, in Proceedings of the 2019 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2019<\/i>, Association for Computing Machinery, (2019), 65\u201372. https:\/\/doi.org\/10.1145\/3341161.3342890<\/ext-link>"},{"key":"key-10.3934\/nhm.2023068-52","doi-asserted-by":"crossref","unstructured":"J. Zhang, Y. Luo, Degree centrality, betweenness centrality, and closeness centrality in social network, in Proceedings of the 2017 2nd International Conference on Modelling, Simulation and Applied Mathematics (MSAM2017)<\/i>, 132<\/b> (2017), 300\u2013303. https:\/\/doi.org\/10.2991\/msam-17.2017.68<\/ext-link>","DOI":"10.2991\/msam-17.2017.68"},{"key":"key-10.3934\/nhm.2023068-53","doi-asserted-by":"publisher","unstructured":"M. E. J. Newman, A measure of betweenness centrality based on random walks, Soc. Net.<\/i>, 27<\/b> (2005), 39\u201354. https:\/\/doi.org\/10.1016\/j.socnet.2004.11.009","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"key-10.3934\/nhm.2023068-54","doi-asserted-by":"publisher","unstructured":"D. F. Gleich, PageRank beyond the Web, SIAM Rev.<\/i>, 57<\/b> (2015), 321\u2013363. https:\/\/doi.org\/10.1137\/140976649","DOI":"10.1137\/140976649"}],"container-title":["Networks and Heterogeneous Media"],"original-title":[],"link":[{"URL":"http:\/\/www.aimspress.com\/article\/doi\/10.3934\/nhm.2023068?viewType=html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,20]],"date-time":"2023-07-20T10:51:04Z","timestamp":1689850264000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.aimspress.com\/article\/doi\/10.3934\/nhm.2023068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":54,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.3934\/nhm.2023068","relation":{},"ISSN":["1556-1801"],"issn-type":[{"value":"1556-1801","type":"print"}],"subject":[],"published":{"date-parts":[[2023]]}}}