A scalable GRASP algorithm for the targeted misinformation blocking problem

dc.affiliation.dptoInformática y Estadística
dc.contributor.authorPenedo, Iván
dc.contributor.authorLozano-Osorio, Isaac
dc.contributor.authorSánchez-Oro, Jesús
dc.date.accessioned2026-04-17T07:20:53Z
dc.date.issued2026-04-10
dc.description.abstractThe research on Social Network Analysis has exponentially grown in the last decades due to the relevance of social networks in the society. Although most of the works have been focused on the maximization of influence, the spread of misinformation and its impact in relevant aspects of the society such as politics or economy, among others, have attracted the attention of both practitioners and the scientific community. This work is focused on the Targeted Misinformation Blocking Problem (TMB), whose aim is to minimize the number of nodes required to reduce the spread of misinformation through a social network. It is considered that if the information is spread under a certain target, then it would not have effect on the network. Therefore, the objective is to find a subset of blocking nodes that guarantee that the spread of information is below that target. However, existing state-of-the-art approaches face significant scalability limitations, often failing to generate feasible solutions for large-scale networks due to the high computational cost of influence estimation. To that end, a Scalable Greedy Randomized Adaptive Search Procedure (GRASP) algorithm is proposed, being able to deal with medium and large scale networks in reasonable computing time. The results obtained are compared with the best method found in the literature, Scalable TMB, which generates a set of trees to simulate the influence spread and identify the most promising nodes. Experimental results show that the proposed algorithm is able to outperform the state of the art when considering two of the most extended diffusion models. Additionally, the scalability of the proposal is proven, been able to provide high-quality solutions even in those instances in which previous algorithm are not able to generate a feasible one. Those results, supported by non-parametric statistical tests, indicates that the proposed algorithm is a competitive method for solving the TMB.
dc.description.sponsorshipEsta investigación ha sido posible gracias al apoyo de la Comunidad Autónoma de Madrid (n.º de referencia de la subvención: TEC-2024/COM-404), el Ministerio de Economía y Competitividad (subvención ref. PID2021-125709OA-C22) y el Ministerio para la Transformación Digital y de la Función Pública (Cátedra ENIA AI4DDS, subvención ref. TSI-100930-2023-3).
dc.identifier.citationPenedo, I., Lozano-Osorio, I., & Sánchez-Oro, J. (2026). A scalable GRASP algorithm for the targeted misinformation blocking problem. Applied Soft Computing, 115201.
dc.identifier.doihttps://doi.org/10.1016/j.asoc.2026.115201
dc.identifier.issn1872-9681
dc.identifier.publicationissue115201
dc.identifier.publicationtitleApplied Soft Computing
dc.identifier.publicationvolume197
dc.identifier.urihttps://hdl.handle.net/10115/197057
dc.identifier.urlhttps://grafo.etsii.urjc.es/TMB/
dc.identifier.urlhttps://doi.org/10.5281/zenodo.19510287
dc.language.isoen_US
dc.publisherElsevier
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internationalen
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subjectSocial networks
dc.subjectInfluence minimization
dc.subjectBlocking set
dc.subjectCombinatorial optimization
dc.subjectMetaheuristics
dc.titleA scalable GRASP algorithm for the targeted misinformation blocking problem
dc.typeArticle
dc.type.hasVersionhttp://purl.org/coar/version/c_970fb48d4fbd8a85

Files

Original bundle

Now showing 1 - 2 of 2
Loading...
Name:
TMB-ASOC.pdf
Size:
570.03 KB
Format:
Adobe Portable Document Format
Loading...
Name:
1-s2.0-S1568494626006496-main.pdf
Size:
1.69 MB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Name:
license.txt
Size:
2.96 KB
Format:
Item-specific license agreed upon to submission
Description: