Computer Science ›› 2022, Vol. 49 ›› Issue (11): 316-325.doi: 10.11896/jsjkx.211000043

• Information Security • Previous Articles     Next Articles

Misinformation Correction Maximization Problem with Edge Addition in Social Networks

SONG Xin-yue, SHUAI Tian-ping, CHEN Bin   

  1. School of Science,Beijing University of Posts and Telecommunications,Beijing 100876,China
  • Received:2021-10-08 Revised:2022-04-22 Online:2022-11-15 Published:2022-11-03
  • About author:SONG Xin-yue,born in 1998,postgra-duate.Her main research interests include combinatorial optimization and social network.
    SHUAI Tian-ping,born in 1977,Ph.D,associate professor.His main research interests include combinatorial optimization and social network.
  • Supported by:
    National Natural Science Foundation of China(12171051,12171052) and Fundamental Research Funds for the Central Universities of China(500421358).

Abstract: The popularity of online social networks such as Wechat has aroused people’s more attention to information diffusion.The spread of misinformation in social networks may lead to serious consequences,such as economic losses and public panic.Therefore,relevant measures need to be taken to control the spread of misinformation.The classical misinformation containment problem aims to reduce the impact of misinformation by launching a set of nodes as real information seeds to compete against misinformation.This paper combines the spread of real information with the edge addition,proposes a misinformation correction maximization problem.The proposed problem is NP-hard and the computation of its objective function is #P-hard.Then,we use the sandwich approximation strategy to get an approximation solution since the objective function is neither submodular nor supermodular.We first find submodular lower and upper bound functions of the objective function,and then get corresponding approximation solutions under the cardinality constraint by the reverse influence sampling technique.At last,combined with lower and upper bound function’s solution,we obtain an approximation solution for misinformation correction maximization problem with a data-dependent approximation ratio.Experiments on three realistic data sets indicate that the proposed algorithm is efficient and performs better than classical heuristic methods.

Key words: Social network, Information diffusion, Influence maximization, Misinformation containment, Sandwich approximation strategy

CLC Number: 

  • TP391
[1]KEMPE D,KLEINBERG J,TARDOS É.Maximizing the spread of infıuence through a social network[C]//Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.ACM,2003:137-146.
[2]CHEN W,WANG C,WANG Y J.Scalable influence maximization for prevalent viral marketing in large-scale social networks[C]//Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.ACM,2010:1029-1038.
[3]BROGS C,BRAUTBAR M,CHAYES J,et al.Maximizing social infıuence in nearly optimal time [C]//Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms.SIAM,2014:946-957.
[4]TANG Y Z,XIAO X K,SHI Y C.Influence maximization:near-optimal time complexity meets practical efficiency[C]//Procee-dings of the 2014 ACM SIGMOD International Conference on Management of Data.ACM,2014:75-86.
[5]TANG Y Z,SHI Y C,XIAO X K.Influence Maximization in Near-Linear Time:A Martingale Approach[C]//Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data.ACM,2015:1539-1554.
[6]HU Q C,ZHANG Y,XING C X.K-clique Heuristic Algorithm for Influence Maximization in Social Network[J].Computer Science,2018,45(6):32-35.
[7]KONG F,LI Q Z,LI S.Survey on Online Influence Maximization [J].Computer Science,2020,47(5):7-13.
[8]TAN Q,ZHANG F L,ZHANG Z Y,et al.Modeling Methods of Social Network User Influence [J].Computer Science,2021,48(2):76-86.
[9]TAN Q,ZHANG F L,WANG T,et al.Social Network User Influence Evaluation Algorithm Integrating Structure Centrality [J].Computer Science,2021,48(7):124-129.
[10]DOERR B,FOUZ M,FRIEDRICH T.Why rumors spread so quickly in social networks [J].Communications of the ACM,2012,55(6):70-75.
[11]BUDAK C,AGRAWAL D,ABBADI E A.Limiting the spread of misinformation in social networks[C]//Proceedings of the 20th International Conference on World Wide Web.ACM,2011:665-674.
[12]HE X R,SONG G J,CHEN W,et al.Influence blocking maximization in social networks under the competitive linear thre-shold model[C]//Proceedings of the 2012 SIAM International Conference on Data Mining.SIAM,2012:463-474.
[13]TONG G M,WU W L,GUO L,et al.An efficient randomized algorithm for rumor blocking in online social networks[J].IEEE Transactions on Network Science and Engineering,2020,7(2):845-854.
[14]WANG S Z,ZHAO X J,CHEN Y,et al.Negative influence mi-nimizing by blocking nodes in social networks [C]//Proceedings of the 17th AAAI Conference on Late-Breaking Developments in the Field of Artificial Intelligence.ACM,2013:134-136.
[15]YAN R D,LI D Y,WU W L,et al.Negative influence minimizing by blocking nodes in social networks [J].IEEE Transactions on Network Science and Engineering,2020,7(3):1067-1078.
[16]KIMURA M,SAITO K,MOTODA H.Minimizing the spread of contamination by blocking links in a network[C]//Proceedings of the 23rd National Conference on Artificial Intelligence-Vo-lume 2.ACM,2008:1175-1180.
[17]KUHLMAN C J,TULI G,SWARUP S,et al.Blocking simple and complex contagion by edge removal [C]//IEEE 13th International Conference on Data Mining.IEEE,2013:399-408.
[18]CHEN J Y,ZHANG D J,LIN X,et al.False Message Propagation Suppression Based on Influence Maximization [J].Compu-ter Science,2020,47(S1):17-23.
[19]VOSOUGHI S,ROY D,ARAL S.The spread of true and false news online [J].Science,2018,359(6380):1146-1151.
[20]CHAOJI V,RANU S,RASTOGI R,et al.Recommendations to boost content spread in social networks[C]//Proceedings of the 21st International Conference on World Wide Web.ACM,2012:529-538.
[21]D’ANGELO G,SEVERINI L,VELAJ Y.Recommending links through influence maximization[J].Theoretical Computer Science,2019,764:30-41.
[22]YU L,LI G H,YUAN L.Maximizing Boosted Influence Spread with Edge Addition in Online Social Networks[J].ACM/IMS Transactions on Data Science,2020,1(2):1-21.
[23]KARP R M.Reducibility among combinatorial problems[C]//Complexity of Computer Computations.Springer,1972:85-103.
[24]VALIANT L G.The complexity of enumeration and reliability problems [J].SIAM Journal on Computing,1979,8(3):410-421.
[25]LU W,CHEN W,LAKSHMANAN L V S.From competition to complementarity:Comparative influence diffusion and maximization [J].Proceedings of the VLDB Endowment,2015,9(2):60-71.
[26]ROSSI R A,AHMED N K.The network data repository with interactive graph analytics and visualization[EB/OL].http://networkrepositoy.com.
[27]GAO C,LIU J,ZHONG N.Network immunization and virus propagation in email networks experimental evaluation and ana-lysis[J].Knowledge and Information Systems,2011,27(2):60-71.
[28]KHALIL E,DIKINA B,SONG L.Scalable diffusion-aware optimization of network topology [C]//Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Disco-very and Data Mining.ACM,2014:1226-1235.
[1] WANG Jian, PENG Yu-qi, ZHAO Yu-fei, YANG Jian. Survey of Social Network Public Opinion Information Extraction Based on Deep Learning [J]. Computer Science, 2022, 49(8): 279-293.
[2] WEI Peng, MA Yu-liang, YUAN Ye, WU An-biao. Study on Temporal Influence Maximization Driven by User Behavior [J]. Computer Science, 2022, 49(6): 119-126.
[3] YU Ai-xin, FENG Xiu-fang, SUN Jing-yu. Social Trust Recommendation Algorithm Combining Item Similarity [J]. Computer Science, 2022, 49(5): 144-151.
[4] CHANG Ya-wen, YANG Bo, GAO Yue-lin, HUANG Jing-yun. Modeling and Analysis of WeChat Official Account Information Dissemination Based on SEIR [J]. Computer Science, 2022, 49(4): 56-66.
[5] ZUO Yuan-lin, GONG Yue-jiao, CHEN Wei-neng. Budget-aware Influence Maximization in Social Networks [J]. Computer Science, 2022, 49(4): 100-109.
[6] GUO Lei, MA Ting-huai. Friend Closeness Based User Matching [J]. Computer Science, 2022, 49(3): 113-120.
[7] SHAO Yu, CHEN Ling, LIU Wei. Maximum Likelihood-based Method for Locating Source of Negative Influence Spreading Under Independent Cascade Model [J]. Computer Science, 2022, 49(2): 204-215.
[8] WANG Jian, WANG Yu-cui, HUANG Meng-jie. False Information in Social Networks:Definition,Detection and Control [J]. Computer Science, 2021, 48(8): 263-277.
[9] TAN Qi, ZHANG Feng-li, WANG Ting, WANG Rui-jin, ZHOU Shi-jie. Social Network User Influence Evaluation Algorithm Integrating Structure Centrality [J]. Computer Science, 2021, 48(7): 124-129.
[10] ZHANG Ren-zhi, ZHU Yan. Malicious User Detection Method for Social Network Based on Active Learning [J]. Computer Science, 2021, 48(6): 332-337.
[11] BAO Zhi-qiang, CHEN Wei-dong. Rumor Source Detection in Social Networks via Maximum-a-Posteriori Estimation [J]. Computer Science, 2021, 48(4): 243-248.
[12] ZHANG Shao-jie, LU Xu-dong, GUO Wei, WANG Shi-peng, HE Wei. Prevention of Dishonest Behavior in Supply-Demand Matching [J]. Computer Science, 2021, 48(4): 303-308.
[13] ZHANG Hao-chen, CAI Ying, XIA Hong-ke. Delivery Probability Based Routing Algorithm for Vehicular Social Network [J]. Computer Science, 2021, 48(3): 289-294.
[14] YUAN De-yu, CHEN Shi-cong, GAO Jian, WANG Xiao-juan. Intervention Algorithm for Distorted Information in Online Social Networks Based on Stackelberg Game [J]. Computer Science, 2021, 48(3): 313-319.
[15] TAN Qi, ZHANG Feng-li, ZHANG Zhi-yang, CHEN Xue-qin. Modeling Methods of Social Network User Influence [J]. Computer Science, 2021, 48(2): 76-86.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!