Influence Minimization via Blocking Strategies

References

• Ackermann W (1928) Zum Hilbertschen Aufbau der reellen Zahlen. Math. Ann. 99(1):118–133.Crossref, Google Scholar
• Aghaee Z, Ghasemi MM, Beni HA, Bouyer A, Fatemi A (2021) A survey on meta-heuristic algorithms for the influence maximization problem in the social networks. Computing 103(11):2437–2477.Crossref, Google Scholar
• Agrawal H (1999) Efficient coverage testing using global dominator graphs. 24:11–20.Google Scholar
• Aho AV, Ullman JD (1973) The Theory of Parsing, Translation, and Compiling. 2: Compiling (Prentice-Hall, Upper Saddle River, NJ).Google Scholar
• Banerjee S, Jenamani M, Pratihar DK (2020) A survey on influence maximization in a social network. Knowledge Inform. Systems 62(9):3417–3455.Crossref, Google Scholar
• Banerjee A, Chandrasekhar AG, Duflo E, Jackson MO (2013) The diffusion of microfinance. Science 341(6144):1236498.Crossref, Google Scholar
• Borgs C, Brautbar M, Chayes JT, Lucier B (2014) Maximizing social influence in nearly optimal time. Chekuri C, ed. Proc. Twenty-Fifth Annual ACM-SIAM Sympos. Discrete Algorithms, SODA 2014 (SIAM, Philadelphia), 946–957.Google Scholar
• Budak C, Agrawal D, Abbadi AE (2011) Limiting the spread of misinformation in social networks. Srinivasan S, Ramamritham K, Kumar A, Ravindra MP, Bertino E, Kumar R, eds. Proc. 20th Internat. Conf. World Wide Web (ACM, New York), 665–674.Google Scholar
• Chen W, Wang C, Wang Y (2010) Scalable influence maximization for prevalent viral marketing in large-scale social networks. Proc. 16th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 1029–1038.Google Scholar
• Chen A, Lee J, Chaulagain B, Kwon Y, Lee KH (2023) SYNTHDB: Synthesizing database via program analysis for security testing of web applications. Proc. Network and Distributed System Security Sympos. (The Internet Society, Reston, VA).Google Scholar
• Domingos PM, Richardson M (2001) Mining the network value of customers. Proc. Seventh ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 57–66.Google Scholar
• Eckles D, Esfandiari H, Mossel E, Rahimian MA (2022) Seeding with costly network information. Oper. Res. 70(4):2318–2348.Link, Google Scholar
• Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J. Global Optim. 6(2):109–133.Crossref, Google Scholar
• Gentzkow HAM (2017) Social media and fake news in the 2016 election. J. Econom. Perspective 31(2):211–236.Google Scholar
• Granovetter M (1978) Threshold models of collective behavior. Amer. J. Sociol. 83(6):1420–1443.Crossref, Google Scholar
• Günneç D, Raghavan S, Zhang R (2020) Least-cost influence maximization on social networks. INFORMS J. Comput. 32(2):289–302.Abstract, Google Scholar
• Guo Q, Wang S, Wei Z, Chen M (2020) Influence maximization revisited: Efficient reverse reachable set generation with bound tightened. Maier D, Pottinger R, Doan A, Tan WC, Alawini A, Ngo HQ, eds. Proc. 2020 Internat. Conf. Management Data, SIGMOD Conf. 2020 (ACM, New York), 2167–2181.Google Scholar
• Ishihata M, Sato T (2011) Bayesian inference for statistical abduction using Markov chain Monte Carlo. Hsu C-N, Lee WS, eds. Proc. 3rd Asian Conf. Machine Learn., ACML 2011, JMLR Proceedings, vol. 20 (JMLR.org), 81–96.Google Scholar
• Jung K, Heo W, Chen W (2012) IRIE: Scalable and robust influence maximization in social networks. Zaki MJ, Siebes A, Yu JX, Goethals B, Webb GI, Wu X, eds. 12th IEEE Internat. Conf. Data Mining, ICDM 2012 (IEEE Computer Society, Washington, DC), 918–923.Google Scholar
• Kempe D, Kleinberg JM, Tardos É (2003) Maximizing the spread of influence through a social network. Getoor L, Senator TE, Domingos PM, Faloutsos C, eds. Proc. Ninth ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 137–146.Google Scholar
• Kempe D, Kleinberg JM, Tardos É (2005) Influential nodes in a diffusion model for social networks. Caires L, Italiano GP, Monteiro L, Palamidessi C, Yung M, eds. Automata, Languages Programming, 32nd Internat. Colloquium, ICALP 2005, Lecture Notes in Computer Science, vol. 3580 (Springer, Berlin, Heidelberg), 1127–1138.Google Scholar
• Kimura M, Saito K, Motoda H (2008) Minimizing the spread of contamination by blocking links in a network. Fox D, Gomes CP, eds. Proc. Twenty-Third AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 1175–1180.Google Scholar
• Kuhlman CJ, Tuli G, Swarup S, Marathe MV, Ravi SS (2013) Blocking simple and complex contagion by edge removal. Xiong H, Karypis G, Thuraisingham B, Cook DJ, Wu X, eds. 2013 IEEE 13th Internat. Conf. Data Mining (IEEE Computer Society, Washington, DC), 399–408.Google Scholar
• Lee C, Sung C, Ma H, Huang J (2019) IDR: Positive influence maximization and negative influence minimization under competitive linear threshold model. 20th IEEE Internat. Conf. Mobile Data Management (IEEE, Piscataway, NJ), 501–506.Google Scholar
• Lengauer T, Tarjan RE (1979) A fast algorithm for finding dominators in a flowgraph. ACM Trans. Programming Language Systems 1(1):121–141.Crossref, Google Scholar
• Liggett TM, Liggett TM (1985) Interacting Particle Systems, vol. 2 (Springer, Berlin, Heidelberg).Crossref, Google Scholar
• Lowry ES, Medlock CW (1969) Object code optimization. Comm. ACM 12(1):13–22.Crossref, Google Scholar
• Maehara T, Suzuki H, Ishihata M (2017) Exact computation of influence spread by binary decision diagrams. Barrett R, Cummings R, Agichtein E, Gabrilovich E, eds. Proc. 26th Internat. Conf. World Wide Web (ACM, New York), 947–956.Google Scholar
• Manouchehri MA, Helfroush MS, Danyali H (2021) A theoretically guaranteed approach to efficiently block the influence of misinformation in social networks. IEEE Trans. Comput. Soc. Systems 8(3):716–727.Crossref, Google Scholar
• McLellan A, Abbasi K (2022) The NHS is not living with COVID, it’s dying from it. British Medical J. 378.Google Scholar
• Newman ME, Forrest S, Balthrop J (2002) Email networks and the spread of computer viruses. Phys. Rev. E 66(3):035101.Crossref, Google Scholar
• Nie L, Song X, Chua T (2016) Learning from Multiple Social Networks. Synthesis Lectures on Information Concepts, Retrieval, and Services (Morgan & Claypool Publishers, San Rafael, CA).Crossref, Google Scholar
• Ohsaka N, Akiba T, Yoshida Y, Kawarabayashi K (2014) Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations. Brodley CE, Stone P, eds. Proc. Twenty-Eighth AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 138–144.Google Scholar
• Pham CV, Phu QV, Hoang HX, Pei J, Thai MT (2019) Minimum budget for misinformation blocking in online social networks. J. Combinatorial Optim. 38(4):1101–1127.Crossref, Google Scholar
• Raghavan S, Zhang R (2022) Influence maximization with latency requirements on social networks. INFORMS J. Comput. 34(2):710–728.Link, Google Scholar
• Reif JH (1978) Symbolic program analysis in almost linear time. Proc. 5th ACM SIGACT-SIGPLAN Sympos. Principles Programming Languages, 76–83.Google Scholar
• Rita A, Jeong H, Barabási AL (2000) Error and attack tolerance of complex networks. Nature 406:378–382.Crossref, Google Scholar
• Schelling TC (2006) Micromotives and Macrobehavior (WW Norton & Company, New York).Google Scholar
• Shah D, Zaman T (2011) Rumors in a network: Who’s the culprit? IEEE Trans. Inform. Theory 57(8):5163–5181.Crossref, Google Scholar
• Shah D, Zaman T (2016) Finding rumor sources on random trees. Oper. Res. 64(3):736–755.Link, Google Scholar
• Sun L, Huang W, Yu PS, Chen W (2018) Multi-round influence maximization. Guo Y, Farooq F, eds. Proc. 24th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (ACM, New York), 2249–2258.Google Scholar
• Sun C, Liu H, Liu M, Ren Z, Gan T, Nie L (2020) LARA: Attribute-to-feature adversarial learning for new-item recommendation. Caverlee J, Hu X, Lalmas M, Wang W, eds. WSDM ’20: Thirteenth ACM Internat. Conf. Web Search (ACM, New York), 582–590.Google Scholar
• Tang Y, Xiao X, Shi Y (2014) Influence maximization: Near-optimal time complexity meets practical efficiency. Dyreson CE, Li F, Özsu MT, eds. Internat. Conf. Management Data, SIGMOD 2014 (ACM, New York), 75–86.Google Scholar
• Teng S, Xie J, Zhang M, Wang K, Zhang F (2023) IMinimize: A system for negative influence minimization via vertex blocking. Frommholz I, Hopfgartner F, Lee M, Oakes M, Lalmas M, Zhang M, Santos RLT, eds. Proc. 32nd ACM Internat. Conf. Inform. Knowledge Management, CIKM 2023 (ACM, New York), 5101–5105.Google Scholar
• Tong G, Wu W, Guo L, Li D, Liu C, Liu B, Du D (2020) An efficient randomized algorithm for rumor blocking in online social networks. IEEE Trans. Network Sci. Engrg. 7(2):845–854.Crossref, Google Scholar
• Tzoumas V, Jadbabaie A, Pappas GJ (2016) Sensor placement for optimal Kalman filtering: Fundamental limits, submodularity, and algorithms. Proc. Amer. Control Conf. (IEEE, New York), 191–196.Google Scholar
• Wang B, Chen G, Fu L, Song L, Wang X, Liu X (2016) DRIMUX: Dynamic rumor influence minimization with user experience in social networks. Schuurmans D, Wellman MP, eds. Proc. Thirtieth AAAI Conf. Artificial Intelligence (AAAI Press, Palo Alto, CA), 791–797.Google Scholar
• Wang S, Zhao X, Chen Y, Li Z, Zhang K, Xia J (2013) Negative influence minimizing by blocking nodes in social networks. Late-Breaking Developments in the Field of Artificial Intelligence (AAAI Press, Palo Alto, CA).Google Scholar
• World Economic Forum (2022) The Global Risks Report 2022 (World Economic Forum, Cologny, Switzerland).Google Scholar
• Wu L, Li J, Sun P, Hong R, Ge Y, Wang M (2020) DiffNet++: A neural influence and interest diffusion network for social recommendation. IEEE Trans. Knowledge Data Engrg. 34(10):4753–4766.Crossref, Google Scholar
• Xie J, Zhang F, Wang K, Lin X, Zhang W (2023) Minimizing the influence of misinformation via vertex blocking. Proc. 39th IEEE Internat. Conf. Data Engrg. (IEEE, New York), 789–801.Google Scholar
• Xie J, Chen Z, Chu D, Zhang F, Lin X, Tian Z (2024a) Influence maximization via vertex countering. Proc. VLDB Endowment 17(6):1297–1309.Crossref, Google Scholar
• Xie J, Zhang F, Wang K, Liu J, Lin X, Zhang W (2024b) Influence minimization via blocking strategies. http://dx.doi.org/10.1287/ijoc.2024.0591.cd, https://github.com/INFORMSJoC/2024.0591.Google Scholar
• Yan R, Li D, Wu W, Du D, Wang Y (2020) Minimizing influence of rumors by blockers on social networks: Algorithms and analysis. IEEE Trans. Network Sci. Engrg. 7(3):1067–1078.Crossref, Google Scholar
• Yao Q, Shi R, Zhou C, Wang P, Guo L (2015) Topic-aware social influence minimization. Gangemi A, Leonardi S, Panconesi A, eds. Proc. 24th Internat. Conf. World Wide Web Companion, WWW 2015 (ACM, New York), 139–140.Google Scholar
• Zareie A, Sakellariou R (2021) Minimizing the spread of misinformation in online social networks: A survey. J. Networks Comput. Appl. 186:103094.Crossref, Google Scholar
• Zhang P, Chen W, Sun X, Wang Y, Zhang J (2014) Minimizing seed set selection with probabilistic coverage guarantee in a social network. Macskassy SA, Perlich C, Leskovec J, Wang W, Ghani R, eds. 20th ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining, KDD ’14 (ACM, New York), 1306–1315.Google Scholar
• Zhou Y, Li J, Hao JK, Glover F (2023) Detecting critical nodes in sparse graphs via “reduce-solve-combine” memetic search. INFORMS J. Comput. 36(1):39–60.Crossref, Google Scholar
• Zhu J, Ni P, Wang G (2020) Activity minimization of misinformation influence in online social networks. IEEE Trans. Comput. Soc. Systems 7(4):897–906.Crossref, Google Scholar