AIM: Activation increment minimization strategy for preventing bad information diffusion in OSNs
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tan, Zhenhua | - |
dc.contributor.author | Wu, DanKe | - |
dc.contributor.author | Gao, Tianhan | - |
dc.contributor.author | You, Ilsun | - |
dc.contributor.author | Sharma, Vishal | - |
dc.date.accessioned | 2021-08-11T09:44:10Z | - |
dc.date.available | 2021-08-11T09:44:10Z | - |
dc.date.issued | 2019-05 | - |
dc.identifier.issn | 0167-739X | - |
dc.identifier.issn | 1872-7115 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/sch/handle/2021.sw.sch/4576 | - |
dc.description.abstract | The openness and virtuality of Online Social Networks (OSNs) make it a hotbed of rapid propagation for various kinds of frauds and erroneous information. Ergo, there is an exigent need to find a method that can expeditiously and efficaciously limit the diffusion of misinformation in OSNs. To resolve this issue, this article proposes the utilization of Activation Increment engendered by a node as a criterion to quantify the importance of the node. Even if the propagation probabilities between the nodes are identically tantamount, due to the dynamics of information propagation and high connectivity of the network, the activation probabilities of nodes are different. The Activation Increment describes the sum of activation probabilities of a node's neighbors while the node itself is in a different state (infected status, recovered status) at a certain time. To utilize Activation Increment, this paper proposes Activation Increment Minimization (AIM) strategy to select and block nodes for information diffusion. Experiments based on the real social network dataset attested that the proposed AIM strategy is superior to the traditional heuristic algorithms. (C) 2018 Published by Elsevier B.V. | - |
dc.format.extent | 9 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Elsevier BV | - |
dc.title | AIM: Activation increment minimization strategy for preventing bad information diffusion in OSNs | - |
dc.type | Article | - |
dc.publisher.location | 네델란드 | - |
dc.identifier.doi | 10.1016/j.future.2018.11.038 | - |
dc.identifier.scopusid | 2-s2.0-85057740512 | - |
dc.identifier.wosid | 000460845200026 | - |
dc.identifier.bibliographicCitation | Future Generation Computer Systems, v.94, pp 293 - 301 | - |
dc.citation.title | Future Generation Computer Systems | - |
dc.citation.volume | 94 | - |
dc.citation.startPage | 293 | - |
dc.citation.endPage | 301 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.subject.keywordPlus | ONLINE SOCIAL NETWORKS | - |
dc.subject.keywordPlus | MODEL | - |
dc.subject.keywordPlus | BLOCKING | - |
dc.subject.keywordAuthor | Diffusion limited | - |
dc.subject.keywordAuthor | Node selection strategies | - |
dc.subject.keywordAuthor | Information diffusion | - |
dc.subject.keywordAuthor | Online social network author biographies | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(31538) 22, Soonchunhyang-ro, Asan-si, Chungcheongnam-do, Republic of Korea+82-41-530-1114
COPYRIGHT 2021 by SOONCHUNHYANG UNIVERSITY ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.