{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T10:46:58Z","timestamp":1774867618093,"version":"3.50.1"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976050"],"award-info":[{"award-number":["61976050"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011789","name":"Department of Science and Technology of Jilin Province","doi-asserted-by":"publisher","award":["20240602005RC"],"award-info":[{"award-number":["20240602005RC"]}],"id":[{"id":"10.13039\/501100011789","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jilin province philosophy and social sciences","award":["2023ZD15"],"award-info":[{"award-number":["2023ZD15"]}]},{"DOI":"10.13039\/501100010211","name":"Education Department of Jilin Province","doi-asserted-by":"publisher","award":["JJKH20250335KJ"],"award-info":[{"award-number":["JJKH20250335KJ"]}],"id":[{"id":"10.13039\/501100010211","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2412022QD041"],"award-info":[{"award-number":["2412022QD041"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s12293-026-00494-6","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:36:45Z","timestamp":1768981005000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["TOTEM: A unified framework for topic-aware temporal influence maximization with dual-interaction diffusion in social networks"],"prefix":"10.1007","volume":"18","author":[{"given":"Yue","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xi","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yupeng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,21]]},"reference":[{"key":"494_CR1","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201903. New York, NY, USA: Association for Computing Machinery; pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"issue":"10","key":"494_CR2","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.14778\/2794367.2794376","volume":"8","author":"Y Li","year":"2015","unstructured":"Li Y, Zhang D, Tan KL (2015) Real-time targeted influence maximization for online advertisements. Proc VLDB Endow. 8(10):1070\u20131081. https:\/\/doi.org\/10.14778\/2794367.2794376","journal-title":"Proc VLDB Endow."},{"key":"494_CR3","doi-asserted-by":"crossref","unstructured":"Barbieri N, Bonchi F, Manco G (2012) Topic-Aware Social Influence Propagation Models. In: 2012 IEEE 12th International Conference on Data Mining; pp 81\u201390","DOI":"10.1109\/ICDM.2012.122"},{"issue":"2","key":"494_CR4","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TNSE.2021.3127921","volume":"9","author":"X Qin","year":"2021","unstructured":"Qin X, Zhong C, Yang Q (2021) An influence maximization algorithm based on community-topic features for dynamic social networks. IEEE Trans Netw Sci Eng 9(2):608\u2013621","journal-title":"IEEE Trans Netw Sci Eng"},{"issue":"3","key":"494_CR5","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1007\/s11280-020-00792-0","volume":"23","author":"H Min","year":"2020","unstructured":"Min H, Cao J, Yuan T, Liu B (2020) Topic based time-sensitive influence maximization in online social networks. World Wide Web 23(3):1831\u20131859. https:\/\/doi.org\/10.1007\/s11280-020-00792-0","journal-title":"World Wide Web"},{"key":"494_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40649-016-0033-z","volume":"3","author":"W Chen","year":"2016","unstructured":"Chen W, Lin T, Yang C (2016) Real-time topic-aware influence maximization using preprocessing. Comput Soc Netw 3:1\u201319","journal-title":"Comput Soc Netw"},{"key":"494_CR7","doi-asserted-by":"crossref","unstructured":"Leskovec J, Krause A, Guestrin C, Faloutsos C, Vanbriesen J, Glance N (2007) Cost-effective outbreak detection in networks. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. vol 420-429; pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"494_CR8","unstructured":"Li H, Yang S, Xu M, Bhowmick SS, Cui J. Influence Maximization in Social Networks: A Survey. Available from: arXiv:2309.04668"},{"key":"494_CR9","doi-asserted-by":"crossref","unstructured":"Chen W, Wang Y, Yang S (2009) Efficient influence maximization in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201909. New York, NY, USA: Association for Computing Machinery; pp. 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"494_CR10","doi-asserted-by":"crossref","unstructured":"Cohen E, Delling D, Pajor T, Werneck RF (2014) Sketch-based Influence Maximization and Computation: Scaling up with Guarantees. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management. CIKM \u201914. New York, NY, USA: Association for Computing Machinery; pp 629\u2013638","DOI":"10.1145\/2661829.2662077"},{"key":"494_CR11","doi-asserted-by":"crossref","unstructured":"Borgs C, Brautbar M, Chayes J, Lucier B (2014) Maximizing social influence in nearly optimal time. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA \u201914. USA: Society for Industrial and Applied Mathematics; pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"494_CR12","doi-asserted-by":"crossref","unstructured":"Tang Y, Shi Y, Xiao X (2015) Influence Maximization in Near-Linear Time: A Martingale Approach. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data. SIGMOD \u201915. New York, NY, USA: Association for Computing Machinery; pp 1539\u20131554","DOI":"10.1145\/2723372.2723734"},{"key":"494_CR13","doi-asserted-by":"publisher","unstructured":"Barik R, Cappa W, Ferdous SM, Minutoli M, Halappanavar M, Kalyanaraman A (2025) GreediRIS: scalable influence maximization using distributed streaming maximum cover. Journal of Parallel and Distributed Computing. Apr;198. https:\/\/doi.org\/10.1016\/j.jpdc.2025.105037","DOI":"10.1016\/j.jpdc.2025.105037"},{"key":"494_CR14","doi-asserted-by":"crossref","unstructured":"Chen W, Wang C, Wang Y (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. KDD \u201910. New York, NY, USA: Association for Computing Machinery; p. 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"494_CR15","doi-asserted-by":"crossref","unstructured":"Jung K, Heo W, Chen W (2012) IRIE: Scalable and Robust Influence Maximization in Social Networks. In: 2012 IEEE 12th International Conference on Data Mining; pp 918\u2013923","DOI":"10.1109\/ICDM.2012.79"},{"key":"494_CR16","doi-asserted-by":"crossref","unstructured":"Wang J, Wu Y, Wang X, Chen C, Zhang Y, Qin L (2025) Effective Influence Maximization with Priority. In: Proceedings of the ACM on Web Conference 2025. WWW \u201925. New York, NY, USA: Association for Computing Machinery; pp 4673\u20134683","DOI":"10.1145\/3696410.3714888"},{"issue":"1","key":"494_CR17","doi-asserted-by":"publisher","first-page":"16322","DOI":"10.1038\/s41598-025-99948-z","volume":"15","author":"MM Daliri Khomami","year":"2025","unstructured":"Daliri Khomami MM, Rezvanian A, Meybodi MR (2025) Maximum independent set in multiplex social networks and its application to influence maximization. Sci Rep 15(1):16322. https:\/\/doi.org\/10.1038\/s41598-025-99948-z","journal-title":"Sci Rep"},{"issue":"4","key":"494_CR18","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1109\/TETCI.2023.3251362","volume":"7","author":"AK Umrawal","year":"2023","unstructured":"Umrawal AK, Quinn CJ, Aggarwal V (2023) A community-aware framework for social influence maximization. IEEE Trans Emerg Top Comput Intell 7(4):1253\u20131262. https:\/\/doi.org\/10.1109\/TETCI.2023.3251362","journal-title":"IEEE Trans Emerg Top Comput Intell"},{"issue":"2","key":"494_CR19","doi-asserted-by":"publisher","first-page":"112","DOI":"10.3390\/info15020112","volume":"15","author":"A Agra","year":"2024","unstructured":"Agra A, Samuco JM (2024) A new algorithm framework for the influence maximization problem using graph clustering. Information 15(2):112. https:\/\/doi.org\/10.3390\/info15020112","journal-title":"Information"},{"issue":"13","key":"494_CR20","doi-asserted-by":"publisher","first-page":"19898","DOI":"10.1007\/s11227-024-06217-3","volume":"80","author":"M Ganguly","year":"2024","unstructured":"Ganguly M, Dey P, Roy S (2024) Influence maximization in community-structured social networks: a centrality-based approach. J Supercomput 80(13):19898\u201319941. https:\/\/doi.org\/10.1007\/s11227-024-06217-3","journal-title":"J Supercomput"},{"key":"494_CR21","unstructured":"Ling C, Jiang J, Wang J, Thai MT, Xue L, Song J, et\u00a0al (2023) Deep graph representation learning and optimization for influence maximization. In: Proceedings of the 40th International Conference on Machine Learning. ICML\u201923. JMLR.org; pp 1253 \u2013 1262"},{"issue":"2","key":"494_CR22","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1109\/TCSS.2024.3459853","volume":"12","author":"S Ghosh","year":"2025","unstructured":"Ghosh S, Chen T, Wu W (2025) Enhanced group influence maximization in social networks using deep reinforcement learning. IEEE Trans Comput Soc Syst 12(2):573\u2013585. https:\/\/doi.org\/10.1109\/TCSS.2024.3459853","journal-title":"IEEE Trans Comput Soc Syst"},{"issue":"1","key":"494_CR23","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s11227-024-06621-9","volume":"81","author":"J Wang","year":"2024","unstructured":"Wang J, Cao Z, Xie C, Li Y, Liu J, Gao Z (2024) DGN: influence maximization based on deep reinforcement learning. J Supercomput 81(1):130. https:\/\/doi.org\/10.1007\/s11227-024-06621-9","journal-title":"J Supercomput"},{"issue":"6","key":"494_CR24","doi-asserted-by":"publisher","first-page":"666","DOI":"10.14778\/2735703.2735706","volume":"8","author":"S Chen","year":"2015","unstructured":"Chen S, Fan J, Li G, Feng J, Kl Tan, Tang J (2015) Online topic-aware influence maximization. Proc VLDB Endow. 8(6):666\u2013677. https:\/\/doi.org\/10.14778\/2735703.2735706","journal-title":"Proc VLDB Endow."},{"key":"494_CR25","doi-asserted-by":"crossref","unstructured":"Santos D, Perkusich A, Almeida H (2014) A Topic Aware-based Approach to Maximize Social Influence. In: Proceedings of the 20th Brazilian Symposium on Multimedia and the Web. WebMedia\u201914. ACM; pp 187\u2013194","DOI":"10.1145\/2664551.2664571"},{"issue":"2","key":"494_CR26","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/tcss.2023.3243936","volume":"11","author":"Z Li","year":"2024","unstructured":"Li Z, Du H, Li X (2024) Topic-Aware Information Coverage Maximization in Social Networks. IEEE Trans Comput Soc Syst 11(2):1722\u20131732. https:\/\/doi.org\/10.1109\/tcss.2023.3243936","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"494_CR27","doi-asserted-by":"publisher","unstructured":"Barbieri N, Bonchi F, Manco G, Research Y (2013) Topic-aware Social Influence Propagation Models. Knowledge and Information Systems. pp 555\u2013584. https:\/\/doi.org\/10.1007\/s10115-013-0646-6","DOI":"10.1007\/s10115-013-0646-6"},{"key":"494_CR28","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-319-73317-3_24","volume-title":"Advanced hybrid information processing","author":"J Zhu","year":"2018","unstructured":"Zhu J, Ming Q, Wang N (2018) Topic-Aware influence maximization in large recommendation social networks. In: Sun G, Liu S (eds) Advanced hybrid information processing. Springer International Publishing, Cham, pp 195\u2013203"},{"issue":"1","key":"494_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41019-020-00117-1","volume":"5","author":"S Tian","year":"2020","unstructured":"Tian S, Mo S, Wang L, Peng Z (2020) Deep reinforcement learning-based approach to tackle topic-aware influence maximization. Data Sci Eng 5(1):1\u201311. https:\/\/doi.org\/10.1007\/s41019-020-00117-1","journal-title":"Data Sci Eng"},{"issue":"6","key":"494_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3651987","volume":"18","author":"K Theocharidis","year":"2024","unstructured":"Theocharidis K, Karras P, Terrovitis M, Skiadopoulos S, Lauw HW (2024) Adaptive content-aware influence maximization via online learning to rank. ACM Trans Knowl Discov Data 18(6):1\u201335. https:\/\/doi.org\/10.1145\/3651987","journal-title":"ACM Trans Knowl Discov Data"},{"key":"494_CR31","unstructured":"Zuo Y, Sun H, Hu Y, Guo J, Gao X. DSCom: a data-driven self-adaptive community-based framework for influence maximization in social networks"},{"key":"494_CR32","doi-asserted-by":"publisher","unstructured":"Rui X, Wang Z, Peng H, Chen W, Yu PS (2025) A Scalable Algorithm for Fair Influence Maximization with Unbiased Estimator. IEEE Trans Knowl Data Eng pp 1\u201315. https:\/\/doi.org\/10.1109\/TKDE.2025.3564283","DOI":"10.1109\/TKDE.2025.3564283"},{"issue":"1","key":"494_CR33","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1109\/TETC.2024.3403891","volume":"13","author":"K Ma","year":"2025","unstructured":"Ma K, Xu X, Yang H, Cao R, Zhang L (2025) Fair influence maximization in social networks: a community-based evolutionary algorithm. IEEE Trans Emerg Top Comput 13(1):262\u2013275. https:\/\/doi.org\/10.1109\/TETC.2024.3403891","journal-title":"IEEE Trans Emerg Top Comput"},{"issue":"2","key":"494_CR34","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/tnse.2021.3127921","volume":"9","author":"X Qin","year":"2022","unstructured":"Qin X, Zhong C, Yang Q (2022) An influence maximization algorithm based on community-topic features for dynamic social networks. IEEE Trans Netw Sci Eng 9(2):608\u2013621. https:\/\/doi.org\/10.1109\/tnse.2021.3127921","journal-title":"IEEE Trans Netw Sci Eng"},{"key":"494_CR35","doi-asserted-by":"publisher","first-page":"161996","DOI":"10.1109\/access.2019.2951757","volume":"7","author":"J Ge","year":"2019","unstructured":"Ge J, Shi LL, Liu L, Sun X (2019) User topic preferences based influence maximization in overlapped networks. IEEE Access 7:161996\u2013162007. https:\/\/doi.org\/10.1109\/access.2019.2951757","journal-title":"IEEE Access"},{"key":"494_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2025.130173","volume":"638","author":"L Teng","year":"2025","unstructured":"Teng L, Wang Y, Lin Z, Yu F (2025) Topic-aware most influential community search in social networks. Neurocomputing 638:130173. https:\/\/doi.org\/10.1016\/j.neucom.2025.130173","journal-title":"Neurocomputing"},{"issue":"14","key":"494_CR37","doi-asserted-by":"publisher","first-page":"16149","DOI":"10.1007\/s10489-022-03430-6","volume":"52","author":"W Jia","year":"2022","unstructured":"Jia W, Ma R, Niu W, Yan L, Ma Z (2022) Topic relevance and temporal activity-aware influence maximization in social network. Appl Intell 52(14):16149\u201316167. https:\/\/doi.org\/10.1007\/s10489-022-03430-6","journal-title":"Appl Intell"},{"key":"494_CR38","doi-asserted-by":"publisher","unstructured":"KERMANI MAMA, GHESMATI R, JALAYER M (2018) OPINION-AWARE INFLUENCE MAXIMIZATION: HOW TO MAXIMIZE A FAVORITE OPINION IN A SOCIAL NETWORK? Advances in Complex Systems. ;21(06n07):1850022. https:\/\/doi.org\/10.1142\/s0219525918500224","DOI":"10.1142\/s0219525918500224"},{"issue":"3","key":"494_CR39","doi-asserted-by":"publisher","first-page":"3255","DOI":"10.1109\/TCSS.2023.3328994","volume":"11","author":"XL Shi","year":"2024","unstructured":"Shi XL, Chen WN, Zhong JH, Zhang J (2024) A max-min ant system with repetitive influence reduction strategy for interactive dissemination of positive and negative information. IEEE Trans Comput Soc Syst 11(3):3255\u20133267. https:\/\/doi.org\/10.1109\/TCSS.2023.3328994","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"494_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123429","volume":"248","author":"M Jaouadi","year":"2024","unstructured":"Jaouadi M, Ben RL (2024) A survey on influence maximization models. Expert Syst Appl 248:123429. https:\/\/doi.org\/10.1016\/j.eswa.2024.123429","journal-title":"Expert Syst Appl"},{"key":"494_CR41","unstructured":"Chen W, Lu W, Zhang N (2012) Time-critical influence maximization in social networks with time-delayed diffusion process. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence. AAAI\u201912. AAAI Press; pp 592\u2013598"},{"key":"494_CR42","doi-asserted-by":"crossref","unstructured":"Liu B, Cong G, Xu D, Zeng Y (2012) Time Constrained Influence Maximization in Social Networks. In: 2012 IEEE 12th International Conference on Data Mining. IEEE; p. 439\u2013448","DOI":"10.1109\/ICDM.2012.158"},{"key":"494_CR43","doi-asserted-by":"publisher","first-page":"151208","DOI":"10.1109\/access.2020.3016913","volume":"8","author":"R Michalski","year":"2020","unstructured":"Michalski R, Jankowski J, Br\u00f3dka P (2020) Effective influence spreading in temporal networks with sequential seeding. IEEE Access 8:151208\u2013151218. https:\/\/doi.org\/10.1109\/access.2020.3016913","journal-title":"IEEE Access"},{"issue":"7","key":"494_CR44","doi-asserted-by":"publisher","first-page":"904","DOI":"10.3390\/e24070904","volume":"24","author":"B Fu","year":"2022","unstructured":"Fu B, Zhang J, Bai H, Yang Y, He Y (2022) An influence maximization algorithm for dynamic social networks based on effective links. Entropy 24(7):904. https:\/\/doi.org\/10.3390\/e24070904","journal-title":"Entropy"},{"key":"494_CR45","doi-asserted-by":"publisher","unstructured":"Yanchenko E, Murata T, Holme P (2024) Influence maximization on temporal networks: a review. Applied Network Science. 05;9(1):16. https:\/\/doi.org\/10.1007\/s41109-024-00625-3","DOI":"10.1007\/s41109-024-00625-3"},{"key":"494_CR46","doi-asserted-by":"crossref","unstructured":"Su J, Sharma A, Goel S (2016) The Effect of Recommendations on Network Structure. In: Proceedings of the 25th International Conference on World Wide Web. WWW \u201916. Republic and Canton of Geneva, CHE: International World Wide Web Conferences Steering Committee; pp 1157\u20131167","DOI":"10.1145\/2872427.2883040"},{"key":"494_CR47","doi-asserted-by":"crossref","unstructured":"Ferrara A, Espin-Noboa L, Karimi F, Wagner C (2022) Link recommendations: their impact on network structure and minorities. In: Proceedings of the 14th ACM Web Science Conference 2022. WebSci \u201922. New York, NY, USA: Association for Computing Machinery; pp 228\u2013238","DOI":"10.1145\/3501247.3531583"},{"key":"494_CR48","unstructured":"Twitter I. The Algorithm: Source Code for Twitter\u2019s Recommendation Algorithm. https:\/\/github.com\/twitter\/the-algorithm"},{"key":"494_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.123429","volume":"248","author":"M Jaouadi","year":"2024","unstructured":"Jaouadi M, Romdhane LB (2024) A survey on influence maximization models. Expert Syst Appl 248:123429. https:\/\/doi.org\/10.1016\/j.eswa.2024.123429","journal-title":"Expert Syst Appl"},{"issue":"1","key":"494_CR50","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/s13278-023-01078-9","volume":"13","author":"A Zareie","year":"2023","unstructured":"Zareie A, Sakellariou R (2023) Influence maximization in social networks: a survey of behaviour-aware methods. Soc Netw Anal Min 13(1):78","journal-title":"Soc Netw Anal Min"},{"key":"494_CR51","unstructured":"Yu P, Merrick L, Nuti G, Campos D. Arctic-Embed 2.0: multilingual retrieval without compromise"},{"issue":"2","key":"494_CR52","doi-asserted-by":"publisher","first-page":"1722","DOI":"10.1109\/TCSS.2023.3243936","volume":"11","author":"Z Li","year":"2024","unstructured":"Li Z, Du H, Li X (2024) Topic-aware information coverage maximization in social networks. IEEE Trans Comput Soc Syst 11(2):1722\u20131732. https:\/\/doi.org\/10.1109\/TCSS.2023.3243936","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"494_CR53","first-page":"993","volume":"3","author":"DM Blei","year":"2003","unstructured":"Blei DM, Ng AY, Jordan MI (2003) Latent dirichlet allocation. J Mach Learn Res 3:993\u20131022","journal-title":"J Mach Learn Res"},{"key":"494_CR54","doi-asserted-by":"publisher","unstructured":"Teh YW, Jordan MI, Beal MJ, DMB (2006) Hierarchical Dirichlet Processes. Journal of the American Statistical Association. 101(476):1566\u20131581. https:\/\/doi.org\/10.1198\/016214506000000302","DOI":"10.1198\/016214506000000302"},{"key":"494_CR55","doi-asserted-by":"crossref","unstructured":"Sia S, Dalmia A, Mielke SJ (2020) Tired of Topic Models? Clusters of Pretrained Word Embeddings Make for Fast and Good Topics too! In: Webber B, Cohn T, He Y, Liu Y, editors. Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP). Online: Association for Computational Linguistics; pp 1728\u20131736","DOI":"10.18653\/v1\/2020.emnlp-main.135"},{"key":"494_CR56","unstructured":"Grootendorst M. BERTopic: neural topic modeling with a class-based TF-IDF procedure"},{"key":"494_CR57","doi-asserted-by":"crossref","unstructured":"Guo L, Tan E, Chen S, Zhang X, Zhao YE (2009) Analyzing patterns of user content generation in online social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201909. New York, NY, USA: Association for Computing Machinery; pp 369\u2013378","DOI":"10.1145\/1557019.1557064"},{"key":"494_CR58","doi-asserted-by":"publisher","unstructured":"Fronczak A, Mrowinski MJ, Fronczak P (2021) Scientific success from the perspective of the strength of weak ties. Scientific Reports. 12. https:\/\/doi.org\/10.1038\/s41598-022-09118-8","DOI":"10.1038\/s41598-022-09118-8"},{"issue":"1","key":"494_CR59","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser GL, Wolsey LA, Fisher ML (1978) An analysis of approximations for maximizing submodular set functions-I. Math Program 14(1):265\u2013294. https:\/\/doi.org\/10.1007\/BF01588971","journal-title":"Math Program"},{"key":"494_CR60","doi-asserted-by":"crossref","unstructured":"Cheng S, Shen H, Huang J, Zhang G, Cheng X (2013) StaticGreedy: solving the scalability-accuracy dilemma in influence maximization. In: Proceedings of the 22nd ACM International Conference on Information & Knowledge Management. CIKM \u201913. New York, NY, USA: Association for Computing Machinery; pp 509\u2013518","DOI":"10.1145\/2505515.2505541"},{"issue":"2","key":"494_CR61","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0318034","volume":"20","author":"D Quelle","year":"2025","unstructured":"Quelle D, Bovet A (2025) Bluesky: network topology, polarization, and algorithmic curation. PLoS ONE 20(2):e0318034. https:\/\/doi.org\/10.1371\/journal.pone.0318034","journal-title":"PLoS ONE"},{"key":"494_CR62","doi-asserted-by":"publisher","unstructured":"Xia G (2019) Influence maximization: a time-space efficient algorithm. IOP Conf Ser Mater Sci Eng 05(533):012048. https:\/\/doi.org\/10.1088\/1757-899X\/533\/1\/012048","DOI":"10.1088\/1757-899X\/533\/1\/012048"},{"key":"494_CR63","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/IEEEDATA.2024.3474640","volume":"1","author":"U Jeong","year":"2024","unstructured":"Jeong U, Jiang B, Tan Z, Bernard HR, Liu H (2024) Descriptor: a temporal multi-network dataset of social interactions in bluesky social (bluetempnet). IEEE Data Descr 1:71\u201379. https:\/\/doi.org\/10.1109\/IEEEDATA.2024.3474640","journal-title":"IEEE Data Descr"},{"key":"494_CR64","doi-asserted-by":"publisher","unstructured":"La\u00a0Cava L, Greco S, Tagarelli A (2021) Understanding the growth of the Fediverse through the lens of Mastodon. Applied Network Science. Sep;6(1). https:\/\/doi.org\/10.1007\/s41109-021-00392-5","DOI":"10.1007\/s41109-021-00392-5"},{"issue":"6684","key":"494_CR65","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH (1998) Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684):440\u2013442. https:\/\/doi.org\/10.1038\/30918","journal-title":"Nature"},{"issue":"3","key":"494_CR66","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","volume":"1","author":"LC Freeman","year":"1978","unstructured":"Freeman LC (1978) Centrality in social networks conceptual clarification. Social Networks 1(3):215\u2013239. https:\/\/doi.org\/10.1016\/0378-8733(78)90021-7","journal-title":"Social Networks"},{"key":"494_CR67","doi-asserted-by":"crossref","unstructured":"Kleppmann M, Frazee P, Gold J, Graber J, Holmgren D, Ivy D, et\u00a0al (2024) Bluesky and the AT Protocol: Usable Decentralized Social Media. In: Proceedings of the ACM Conext-2024 Workshop on the Decentralization of the Internet. DIN \u201924. New York, NY, USA: Association for Computing Machinery; p. 1\u20137","DOI":"10.1145\/3694809.3700740"},{"key":"494_CR68","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-39718-2_23","volume-title":"The semantic web - ISWC 2003","author":"M Richardson","year":"2003","unstructured":"Richardson M, Agrawal R, Domingos P (2003) Trust management for the semantic web. In: Fensel D, Sycara K, Mylopoulos J (eds) The semantic web - ISWC 2003. Berlin, Heidelberg, Springer, Berlin Heidelberg, pp 351\u2013368"},{"key":"494_CR69","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2478\/jaiscr-2024-0010","volume":"14","author":"H Vaghari","year":"2024","unstructured":"Vaghari H, Hosseinzadeh Aghdam M, Emami H (2024) Diarec: dynamic intention-aware recommendation with attention-based context-aware item attributes modeling. J Artif Intell Soft Comput Res 14:171\u2013189. https:\/\/doi.org\/10.2478\/jaiscr-2024-0010","journal-title":"J Artif Intell Soft Comput Res"},{"key":"494_CR70","doi-asserted-by":"publisher","first-page":"49030","DOI":"10.1109\/ACCESS.2025.3551402","volume":"13","author":"H Vaghari","year":"2025","unstructured":"Vaghari H, Hosseinzadeh Aghdam M, Emami H (2025) HAN: hierarchical attention network for learning latent context-aware user preferences with attribute awareness. IEEE Access 13:49030\u201349049. https:\/\/doi.org\/10.1109\/ACCESS.2025.3551402","journal-title":"IEEE Access"},{"issue":"1","key":"494_CR71","doi-asserted-by":"publisher","first-page":"10050","DOI":"10.1038\/s41598-025-94256-y","volume":"15","author":"H Vaghari","year":"2025","unstructured":"Vaghari H, Hosseinzadeh Aghdam M, Emami H (2025) Group attention for collaborative filtering with sequential feedback and context aware attributes. Sci Rep 15(1):10050. https:\/\/doi.org\/10.1038\/s41598-025-94256-y","journal-title":"Sci Rep"},{"key":"494_CR72","doi-asserted-by":"publisher","unstructured":"Vaghari H, Hosseinzadeh\u00a0Aghdam M, Emami H (2025) Context-aware recommendation using hierarchical attention and positional encoding based on multiple item attributes. Signal, Image and Video Processing. 19(14). https:\/\/doi.org\/10.1007\/s11760-025-04765-6","DOI":"10.1007\/s11760-025-04765-6"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-026-00494-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-026-00494-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-026-00494-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T09:47:31Z","timestamp":1774864051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-026-00494-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,21]]},"references-count":72,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["494"],"URL":"https:\/\/doi.org\/10.1007\/s12293-026-00494-6","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,21]]},"assertion":[{"value":"8 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"10"}}