{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T00:13:35Z","timestamp":1768263215776,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,9,9]],"date-time":"2023-09-09T00:00:00Z","timestamp":1694217600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,9]],"date-time":"2023-09-09T00:00:00Z","timestamp":1694217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276100"],"award-info":[{"award-number":["62276100"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Natural Science Funds for Distinguished Young Scholars","award":["2022B1515020049"],"award-info":[{"award-number":["2022B1515020049"]}]},{"name":"Guangdong Regional Joint Fund for Basic and Applied Research","award":["2021B1515120078"],"award-info":[{"award-number":["2021B1515120078"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The influence maximization problem is one of the most fundamental topics in social networks. However, most existing studies have focused on non-attributed networks, neglecting the consideration of users\u2019 properties during information propagation. Additionally, specific scenarios may involve external queries that target a particular subset of users, which has not been adequately addressed in prior research. To address these limitations, this study first formulates the customized influence maximization (CIM) problem in the context of attributed social networks. The node score and influence probability are derived by fully considering the user\u2019s attributes and the external queries. Then, we develop two algorithms to identify a group of most influential nodes in CIM. The first is a heuristic algorithm based on discounted degree, which is able to find relatively high-quality solutions in a short time. The second is a meta-heuristic algorithm, which makes several adjustments to the original ant colony algorithm to make it efficient to the CIM problem. Specifically, multiple CIM-related heuristics are derived, and a heuristic adaptation strategy is designed to automatically assign the heuristic information to ants according to the search environments and stages. Extensive experiments show the promising performance of our proposed algorithms in terms of accuracy, efficiency, and robustness.<\/jats:p>","DOI":"10.1007\/s40747-023-01220-2","type":"journal-article","created":{"date-parts":[[2023,9,9]],"date-time":"2023-09-09T08:01:42Z","timestamp":1694246502000},"page":"1409-1424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Customized influence maximization in attributed social networks: heuristic and meta-heuristic algorithms"],"prefix":"10.1007","volume":"10","author":[{"given":"Jun-Chao","family":"Liang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5648-1160","authenticated-orcid":false,"given":"Yue-Jiao","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Xiao-Kun","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,9]]},"reference":[{"key":"1220_CR1","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 25th annual ACM-SIAM symposium on discrete algorithms, pp 946\u2013957","DOI":"10.1137\/1.9781611973402.70"},{"key":"1220_CR2","doi-asserted-by":"crossref","unstructured":"Cao J, Zhou T, Dong D, Xu S, Zhu Z, Ma Z, Liu B (2016) Attribute-based influence maximization in social networks. In: International conference on web information systems engineering, pp 3\u201318","DOI":"10.1007\/978-3-319-48740-3_1"},{"key":"1220_CR3","doi-asserted-by":"crossref","unstructured":"Cha M, Mislove A, Gummadi KP (2009) A measurement-driven analysis of information propagation in the flickr social network. In: Proceedings of the 18th international conference on world wide web, pp. 721\u2013730","DOI":"10.1145\/1526709.1526806"},{"key":"1220_CR4","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, pp 1029\u20131038","DOI":"10.1145\/1835804.1835934"},{"key":"1220_CR5","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, pp 199\u2013208","DOI":"10.1145\/1557019.1557047"},{"key":"1220_CR6","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., Zhang, L.: Scalable influence maximization in social networks under the linear threshold model. In: 2010 IEEE International Conference on Data Mining, pp. 88\u201397 (2010)","DOI":"10.1109\/ICDM.2010.118"},{"key":"1220_CR7","volume-title":"Mathematical methods of statistics","author":"H Cram\u00e9r","year":"2016","unstructured":"Cram\u00e9r H (2016) Mathematical methods of statistics. Princeton University Press, Princeton"},{"issue":"7","key":"1220_CR8","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/0305-0548(94)00059-H","volume":"22","author":"D Diakoulaki","year":"1995","unstructured":"Diakoulaki D, Mavrotas G, Papayannakis L (1995) Determining objective weights in multiple criteria problems: the critic method. Comput Oper Res 22(7):763\u2013770","journal-title":"Comput Oper Res"},{"key":"1220_CR9","doi-asserted-by":"crossref","unstructured":"Domingos P, Richardson M (2001) Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD international conference on knowledge discovery and data mining, pp 57\u201366","DOI":"10.1145\/502512.502525"},{"issue":"1","key":"1220_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"1220_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1011122126881","volume":"12","author":"J Goldenberg","year":"2001","unstructured":"Goldenberg J, Libai B, Muller E (2001) Talk of the network: a complex systems look at the underlying process of word-of-mouth. Mark Lett 12(3):211\u2013223","journal-title":"Mark Lett"},{"issue":"3","key":"1220_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCI.2016.2572538","volume":"11","author":"M Gong","year":"2016","unstructured":"Gong M, Song C, Duan C, Ma L, Shen B (2016) An efficient memetic algorithm for influence maximization in social networks. IEEE Comput Intell Mag 11(3):22\u201333","journal-title":"IEEE Comput Intell Mag"},{"key":"1220_CR13","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","volume":"367","author":"M Gong","year":"2016","unstructured":"Gong M, Yan J, Shen B, Ma L, Cai Q (2016) Influence maximization in social networks based on discrete particle swarm optimization. Inf Sci 367:600\u2013614","journal-title":"Inf Sci"},{"issue":"2","key":"1220_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2594455","volume":"5","author":"NZ Gong","year":"2014","unstructured":"Gong NZ, Talwalkar A, Mackey L, Huang L, Shin ECR, Stefanov E, Shi E, Song D (2014) Joint link prediction and attribute inference using a social-attribute network. ACM Trans Intell Syst Technol 5(2):1\u201320","journal-title":"ACM Trans Intell Syst Technol"},{"key":"1220_CR15","doi-asserted-by":"crossref","unstructured":"Gong N.Z, Xu W, Huang L, Mittal P, Stefanov E, Sekar V, Song D (2012) Evolution of social-attribute networks: measurements, modeling, and implications using google+. In: Proceedings of the 2012 internet measurement conference, pp 131\u2013144","DOI":"10.1145\/2398776.2398792"},{"key":"1220_CR16","doi-asserted-by":"crossref","unstructured":"Goyal A, Lu W, Lakshmanan L.V (2011) Celf++ optimizing the greedy algorithm for influence maximization in social networks. In: Proceedings of the 20th international conference companion on world wide web, pp 47\u201348","DOI":"10.1145\/1963192.1963217"},{"issue":"2","key":"1220_CR17","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/TEVC.2022.3170638","volume":"27","author":"HG Huang","year":"2022","unstructured":"Huang HG, Gong YJ (2022) Contrastive learning: an alternative surrogate for offline data-driven evolutionary computation. IEEE Trans Evol Comput 27(2):370\u2013384","journal-title":"IEEE Trans Evol Comput"},{"key":"1220_CR18","doi-asserted-by":"crossref","unstructured":"Huang T, Gong YJ, Kwong S, Wang H, Zhang J (2019) A niching memetic algorithm for multi-solution traveling salesman problem. IEEE Trans Evol Comput 24(3):508\u2013522","DOI":"10.1109\/TEVC.2019.2936440"},{"issue":"1","key":"1220_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-016-0028-x","volume":"7","author":"C Jia","year":"2017","unstructured":"Jia C, Li Y, Carson MB, Wang X, Yu J (2017) Node attribute-enhanced community detection in complex networks. Sci Rep 7(1):1\u201315","journal-title":"Sci Rep"},{"key":"1220_CR20","doi-asserted-by":"crossref","unstructured":"Jiang Q, Song G, Gao C, Wang Y, Si W, Xie K (2011) Simulated annealing based influence maximization in social networks. In: 25th AAAI conference on artificial intelligence, pp 127\u2013132","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"1220_CR21","doi-asserted-by":"crossref","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9 (2003) Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining, pp 137\u2013146","DOI":"10.1145\/956750.956769"},{"key":"1220_CR22","doi-asserted-by":"crossref","unstructured":"Lee J.R, Chung C.W (2014) A fast approximation for influence maximization in large social networks. In: Proceedings of the 23rd international conference on world wide web, pp 1157\u20131162","DOI":"10.1145\/2567948.2580063"},{"key":"1220_CR23","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 13th ACM SIGKDD international conference on knowledge discovery and data mining, pp 420\u2013429","DOI":"10.1145\/1281192.1281239"},{"key":"1220_CR24","doi-asserted-by":"crossref","unstructured":"Li FH, Li CT, Shan MK (2011) Labeled influence maximization in social networks for target marketing. In: 2011 IEEE 3rd international conference on privacy, security, risk and trust and 2011 IEEE 3rd international conference on social computing, pp 560\u2013563","DOI":"10.1109\/PASSAT\/SocialCom.2011.152"},{"key":"1220_CR25","doi-asserted-by":"crossref","unstructured":"Li Y, Zhang D, Tan KL (2015) Real-time targeted influence maximization for online advertisements. In: Proceedings of the VLDB endowment, pp 1070\u20131081","DOI":"10.14778\/2794367.2794376"},{"key":"1220_CR26","doi-asserted-by":"crossref","unstructured":"Li Z, Wang X, Li J, Zhang Q (2021) Deep attributed network representation learning of complex coupling and interaction. Knowl Based Syst 212:106618","DOI":"10.1016\/j.knosys.2020.106618"},{"issue":"12","key":"1220_CR27","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1109\/TKDE.2018.2819980","volume":"30","author":"L Liao","year":"2018","unstructured":"Liao L, He X, Zhang H, Chua TS (2018) Attributed social network embedding. IEEE Trans Knowl Data Eng 30(12):2257\u20132270","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1220_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107169","volume":"227","author":"H Ma","year":"2021","unstructured":"Ma H, Liu Z, Zhang X, Zhang L, Jiang H (2021) Balancing topology structure and node attribute in evolutionary multi-objective community detection for attributed networks. Knowl Based Syst 227:107169","journal-title":"Knowl Based Syst"},{"key":"1220_CR29","doi-asserted-by":"crossref","unstructured":"Ma YN, Gong YJ, Xiao CF, Gao Y, Zhang J (2018) Path planning for autonomous underwater vehicles: an ant colony algorithm incorporating alarm pheromone. IEEE Trans Veh Technol 68(1):141\u2013154","DOI":"10.1109\/TVT.2018.2882130"},{"key":"1220_CR30","unstructured":"Reynolds HT, Reynolds H (1977) The analysis of cross-classifications. Free Press, New York"},{"issue":"1","key":"1220_CR31","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s42488-021-00041-7","volume":"3","author":"Z Roozbahani","year":"2021","unstructured":"Roozbahani Z, Rezaeenour J, Shahrooei R, Emamgholizadeh H (2021) Presenting a dataset for collaborator recommending systems in academic social network. J Data Inf Manag 3(1):29\u201340","journal-title":"J Data Inf Manag"},{"issue":"13","key":"1220_CR32","doi-asserted-by":"publisher","first-page":"10181","DOI":"10.1007\/s00500-019-04533-y","volume":"24","author":"SS Singh","year":"2020","unstructured":"Singh SS, Singh K, Kumar A, Biswas B (2020) Aco-im: maximizing influence in social networks using ant colony optimization. Soft Comput 24(13):10181\u201310203","journal-title":"Soft Comput"},{"key":"1220_CR33","doi-asserted-by":"crossref","unstructured":"Tang J, Zhang R, Yao Y, Zhao Z, Wang P, Li H, Yuan J (2018) Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowl-Based Syst 160:88\u2013103","DOI":"10.1016\/j.knosys.2018.06.013"},{"key":"1220_CR34","doi-asserted-by":"crossref","unstructured":"Tejaswi V, Bindu P, Thilagam PS (2017) Target specific influence maximization: An approach to maximize adoption in labeled social networks. In: 2017 9th international conference on communication systems and networks, pp 542\u2013547","DOI":"10.1109\/COMSNETS.2017.7945450"},{"issue":"16","key":"1220_CR35","doi-asserted-by":"publisher","first-page":"4165","DOI":"10.1016\/j.physa.2011.12.021","volume":"391","author":"AL Traud","year":"2012","unstructured":"Traud AL, Mucha PJ, Porter MA (2012) Social structure of facebook networks. Phys A 391(16):4165\u20134180","journal-title":"Phys A"},{"key":"1220_CR36","doi-asserted-by":"crossref","unstructured":"Zhang Z, Yang H, Bu J, Zhou S, Yu P, Zhang J, Ester M, Wang C (2018) Anrl: attributed network representation learning via deep neural networks. In: Proceedings of the 27th international joint conference on artificial intelligence, pp 3155\u20133161","DOI":"10.24963\/ijcai.2018\/438"},{"key":"1220_CR37","doi-asserted-by":"crossref","unstructured":"Zhe C, Sun A, Xiao X (2019) Community detection on large complex attribute network. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery and data mining, pp 2041\u20132049","DOI":"10.1145\/3292500.3330721"},{"key":"1220_CR38","doi-asserted-by":"crossref","unstructured":"Zhou Y, Cheng H, Yu JX (2010) Clustering large attributed graphs: an efficient incremental approach. In: 2010 IEEE international conference on data mining, pp 689\u2013698","DOI":"10.1109\/ICDM.2010.41"},{"key":"1220_CR39","volume-title":"Fuzzy set theory\u2014and its applications","author":"HJ Zimmermann","year":"2011","unstructured":"Zimmermann HJ (2011) Fuzzy set theory\u2014and its applications. Springer Science & Business Media, Dordrecht"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01220-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-01220-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-01220-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T22:36:12Z","timestamp":1707604572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-01220-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,9]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1220"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-01220-2","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,9]]},"assertion":[{"value":"21 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2023","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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}