A Max–Min Ant System With Repetitive Influence Reduction Strategy for Interactive Dissemination of Positive and Negative Information
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shi, Xuan-Li | - |
dc.contributor.author | Chen, Wei-Neng | - |
dc.contributor.author | Zhong, Jing-Hui | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-12-11T06:00:17Z | - |
dc.date.available | 2023-12-11T06:00:17Z | - |
dc.date.issued | 2023-12 | - |
dc.identifier.issn | 2329-924X | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/116214 | - |
dc.description.abstract | The rapid development of online social networks (OSNs) has facilitated people to express opinions and share information. To optimize the utility of information dissemination in OSNs, problems such as influence maximization have received increasing attention in recent years. However, not only positive information but also negative information is spreading in OSNs. The dissemination of positive and negative information interacts with each other, making network dissemination analysis and utility optimization more challenging. To this end, we develop a negative–neutral–positive–susceptible (NNPS) model and propose a max–min ant system algorithm with a repetitive influence reduction strategy (MMAS-RIR). First, an NNPS model with a novel heterogenous influence indicator is constructed to simulate the interactive dissemination of positive and negative information. The influence of each user’s neighbors on each user is treated differently, producing heterogenous state transition probabilities for users. Second, we formulate the control of information dissemination as an optimization problem with a designed control scheme. The disruption strategy and counterbalance strategy are automatically implemented on the selected users according to their states in the control scheme. Third, we specially develop a MMAS-RIR algorithm for the formulated problem, where the repetitive influence reduction strategy is used to reduce the influence repeated range of the connected users. Moreover, to improve the exploitation, an adaptive local search is added in MMAS-RIR. Finally, various experiments are conducted to validate the effectiveness of our work. | - |
dc.format.extent | 13 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE Systems, Man, and Cybernetics Society | - |
dc.title | A Max–Min Ant System With Repetitive Influence Reduction Strategy for Interactive Dissemination of Positive and Negative Information | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/TCSS.2023.3328994 | - |
dc.identifier.scopusid | 2-s2.0-85184811865 | - |
dc.identifier.wosid | 001123105300001 | - |
dc.identifier.bibliographicCitation | IEEE Transactions on Computational Social Systems, v.11, no.3, pp 3255 - 3267 | - |
dc.citation.title | IEEE Transactions on Computational Social Systems | - |
dc.citation.volume | 11 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 3255 | - |
dc.citation.endPage | 3267 | - |
dc.type.docType | Article; Early Access | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Cybernetics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | INFLUENCE MAXIMIZATION | - |
dc.subject.keywordPlus | COLONY OPTIMIZATION | - |
dc.subject.keywordPlus | EVOLUTIONARY ALGORITHM | - |
dc.subject.keywordPlus | MISINFORMATION | - |
dc.subject.keywordPlus | SEARCH | - |
dc.subject.keywordPlus | NETWORKS | - |
dc.subject.keywordAuthor | Ant colony optimization (ACO) | - |
dc.subject.keywordAuthor | multiple information dissemination | - |
dc.subject.keywordAuthor | social network | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/10336945 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG 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.