{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T02:29:30Z","timestamp":1782959370711,"version":"3.54.5"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T00:00:00Z","timestamp":1621382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Italian MIUR PRIN 2017 Project ALGADIMAR \u201cAlgorithms, Games, and Digital Markets.\u201d"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2021,6,28]]},"abstract":"<jats:p>Social link recommendation systems, like \u201cPeople-you-may-know\u201d on Facebook, \u201cWho-to-follow\u201d on Twitter, and \u201cSuggested-Accounts\u201d on Instagram assist the users of a social network in establishing new connections with other users. While these systems are becoming more and more important in the growth of social media, they tend to increase the popularity of users that are already popular. Indeed, since link recommenders aim to predict user behavior, they accelerate the creation of links that are likely to be created in the future and, consequently, reinforce social bias by suggesting few (popular) users, giving few chances to most users to create new connections and increase their popularity.<\/jats:p>\n          <jats:p>\n            In this article, we measure the popularity of a user by means of her social influence, which is her capability to influence other users\u2019 opinions, and we propose a link recommendation algorithm that evaluates the links to suggest according to their increment in social influence instead of their likelihood of being created. In detail, we give a\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            factor approximation algorithm for the problem of maximizing the social influence of a given set of target users by suggesting a fixed number of new connections considering the Linear Threshold model as model for diffusion. We experimentally show that, with few new links and small computational time, our algorithm is able to increase by far the social influence of the target users. We compare our algorithm with several baselines and show that it is the most effective one in terms of increased influence.\n          <\/jats:p>","DOI":"10.1145\/3449023","type":"journal-article","created":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T17:08:53Z","timestamp":1621444133000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Link Recommendation for Social Influence Maximization"],"prefix":"10.1145","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7321-3467","authenticated-orcid":false,"given":"Federico","family":"Cor\u00f3","sequence":"first","affiliation":[{"name":"Computer Science Department - Sapienza University of Rome, Rome, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gianlorenzo","family":"D\u2019angelo","sequence":"additional","affiliation":[{"name":"Gran Sasso Science Institute, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yllka","family":"Velaj","sequence":"additional","affiliation":[{"name":"University of Vienna, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,5,19]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"key":"e_1_2_1_2_1","volume-title":"Retrieved","year":"2015","unstructured":"Arnetminer. 2015 . Arnetminer . Retrieved January 15, 2015 from http:\/\/arnetminer.org. Arnetminer. 2015. Arnetminer. Retrieved January 15, 2015 from http:\/\/arnetminer.org."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935914"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781894.1781932"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2013.865686"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/644108.644133"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187908"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187908"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/120879828"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2662077"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2953882"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 17th Italian Conference on Theoretical Computer Science. CEUR-WS.org, 269\u2013274","author":"D\u2019Angelo Gianlorenzo","year":"2016","unstructured":"Gianlorenzo D\u2019Angelo , Lorenzo Severini , and Yllka Velaj . 2016 . Influence maximization in the independent cascade model . In Proceedings of the 17th Italian Conference on Theoretical Computer Science. CEUR-WS.org, 269\u2013274 . http:\/\/ceur-ws.org\/Vol-1720\/short9.pdf. Gianlorenzo D\u2019Angelo, Lorenzo Severini, and Yllka Velaj. 2016. Influence maximization in the independent cascade model. In Proceedings of the 17th Italian Conference on Theoretical Computer Science. CEUR-WS.org, 269\u2013274. http:\/\/ceur-ws.org\/Vol-1720\/short9.pdf."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.01.017"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.09.015"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/isre.1120.0461"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018703"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2585591"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 13th Metaheuristics International Conference.","author":"Interian Ruben","unstructured":"Ruben Interian , Jorge R. Moreno , and Celso C. Ribeiro . 2019. Polarization reduction by minimum-cardinality balanced edge additions: Formulations, complexity, and integer programming . In Proceedings of the 13th Metaheuristics International Conference. Ruben Interian, Jorge R. Moreno, and Celso C. Ribeiro. 2019. Polarization reduction by minimum-cardinality balanced edge additions: Formulations, complexity, and integer programming. In Proceedings of the 13th Metaheuristics International Conference."},{"key":"e_1_2_1_21_1","first-page":"547","article-title":"\u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura","volume":"37","author":"Jaccard Paul","year":"1901","unstructured":"Paul Jaccard . 1901 . \u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura . Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles 37 (1901), 547 \u2013 579 . Paul Jaccard. 1901. \u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura. Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles 37 (1901), 547\u2013579.","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a004"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623704"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89197-0_94"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 13th ICDM. 399\u2013408","author":"Kuhlman Chris J.","year":"2013","unstructured":"Chris J. Kuhlman , Gaurav Tuli , Samarth Swarup , Madhav V. Marathe , and S. S. Ravi . 2013. Blocking simple and complex contagion by edge removal . In Proceedings of the 13th ICDM. 399\u2013408 . DOI:https:\/\/doi.org\/10.1109\/ICDM. 2013 .47 10.1109\/ICDM.2013.47 Chris J. Kuhlman, Gaurav Tuli, Samarth Swarup, Madhav V. Marathe, and S. S. Ravi. 2013. Blocking simple and complex contagion by edge removal. In Proceedings of the 13th ICDM. 399\u2013408. DOI:https:\/\/doi.org\/10.1109\/ICDM.2013.47"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796570"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_2_1_29_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. Retrieved from http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. Retrieved from http:\/\/snap.stanford.edu\/data."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2016.2446"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131782"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1241540.1241551"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.07.008"},{"key":"e_1_2_1_34_1","volume-title":"Link prediction in complex networks: A survey. CoRR abs\/1010.0725","author":"Lu Linyuan","year":"2010","unstructured":"Linyuan Lu and Tao Zhou . 2010. Link prediction in complex networks: A survey. CoRR abs\/1010.0725 ( 2010 ). arxiv:1010.0725 http:\/\/arxiv.org\/abs\/1010.0725 Linyuan Lu and Tao Zhou. 2010. Link prediction in complex networks: A survey. CoRR abs\/1010.0725 (2010). arxiv:1010.0725 http:\/\/arxiv.org\/abs\/1010.0725"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0006-z"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3012704"},{"key":"e_1_2_1_37_1","volume-title":"Singh","author":"Medya Sourav","year":"2019","unstructured":"Sourav Medya , Arlei Silva , and Ambuj K . Singh . 2019 . Influence minimization under budget and matroid constraints: Extended version. CoRR abs\/1901.02156 (2019). arxiv:1901.02156 http:\/\/arxiv.org\/abs\/1901.02156 Sourav Medya, Arlei Silva, and Ambuj K. Singh. 2019. Influence minimization under budget and matroid constraints: Extended version. CoRR abs\/1901.02156 (2019). arxiv:1901.02156 http:\/\/arxiv.org\/abs\/1901.02156"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.11.001"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2757281"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835818"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-018-0252-3"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240371"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/3023549.3023611"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186140"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883040"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-9991-1"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2728064"},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the NIPS Workshop on Networks in the Social and Information Sciences.","author":"Wu Xiaojian","year":"2015","unstructured":"Xiaojian Wu , Daniel Sheldon , and Shlomo Zilberstein . 2015 . Efficient algorithms to optimize diffusion processes under the independent cascade model . In Proceedings of the NIPS Workshop on Networks in the Social and Information Sciences. Xiaojian Wu, Daniel Sheldon, and Shlomo Zilberstein. 2015. Efficient algorithms to optimize diffusion processes under the independent cascade model. In Proceedings of the NIPS Workshop on Networks in the Social and Information Sciences."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3301302"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2605088"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449023","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3449023","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:45Z","timestamp":1750191465000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3449023"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,19]]},"references-count":52,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,6,28]]}},"alternative-id":["10.1145\/3449023"],"URL":"https:\/\/doi.org\/10.1145\/3449023","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,19]]},"assertion":[{"value":"2020-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}