Computer Science ›› 2022, Vol. 49 ›› Issue (4): 100-109.doi: 10.11896/jsjkx.210300228

• Database & Big Data & Data Science • Previous Articles     Next Articles

Budget-aware Influence Maximization in Social Networks

ZUO Yuan-lin, GONG Yue-jiao, CHEN Wei-neng   

  1. School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China
  • Received:2021-03-24 Revised:2021-08-12 Published:2022-04-01
  • About author:CAO He-xin,born in 1994,postgra-duate.His main research interests include natural language processing and know-ledge graph.LI Xue-feng,born in 1975,Ph.D,asso-ciate professor.His main research interests include NDT,pattern recognition algorithm and signal processing.作者简介:(zuoyuanlin0712@qq.com)
  • Supported by:
    This work was supported by the Key Project of Science and Technology Innovation 2030 of Ministry of Science and Technology of China(2018AAA0101300),National Natural Science Foundation of China(61873095) and Fundamental Research Funds for the Central Universities.

Abstract: The influence maximization of social networks is a crucial problem in the field of network science, which has wide applications from advertising to public opinion control.This problem refers to selecting a set of source nodes in a social graph to achieve the greatest influence under a certain propagation model.Since the node selection problem is a typical NP-hard problem, it will encounter the combinatorial explosion when facing large-scale networks.Hence, in recent years, heuristic algorithms are ge-nerally adopted to obtain approximate solutions to the problems in acceptable time.However, the existing work rarely considers the cost of selected nodes, and hence the solutions obtained cannot meet the budget limitations in practical applications.This paper aims to solve the influence maximization problem of social networks under cost-constrained conditions.By fully considering the costs, we build a budget-aware influence maximization model and propose a node selection algorithm named community detection-based ant colony system (CDACS) to deal with it.First, in order to save the unnecessary expenditure coming from the redundant coverage of source nodes, we use the fast greedy modularity maximization algorithm to cluster the network, and introduce a cross-community walking factor in the state transition process of ants to enhance the global exploration ability of the ant colony on the network.Second, we specifically design a penalty-based evaluation function to guide the search towards budget-feasible region as well as developing new heuristic and pheromone forms to enhance the search efficiency.Experimental results on real datasets show that the CDACS algorithm enhances the traditional ant colony algorithm by achieving a 15% improvement in the average coverage rate and a 20% reduction in the running time overhead.Compared with other existing influence maximization algorithms, the coverage effect has also been significantly improved.Moreover, the reliability of the CDACS algorithm in cost control has been validated by experiments.

Key words: Ant colony system, Community clustering, Cost control, Influence maximization, Social network

CLC Number: 

  • TP391
[1] LBAIK C,JAGADISH H V,LI Y Y.Bridging the semantic gap with SQL query logs in natural language interfaces to databases[J].arXiv:1902.00031,2019.
[2] WU Z,PAN S,CHEN F,et al.A Comprehensive Survey onGraph Neural Networks[J].IEEE Transactions on Neural Networks and Learning Systems,2020(99):1-21.
[3] ANDROUTSOPOULOS I,RITCHIE G D,THANISCH P.Na-tural Language Interfaces to Databases-An Introduction[J].Natural Language Engineering,1995,1(1):29-81.
[4] POPESCU A M, ARMANASU A, ETZIONI O,et al.Modern natural language interfaces to databases:Composing statistical parsing with semantic tractability[C]//COLING.2004.
[5] UNGER C,BÜHMANN L,LEHMANN J,et al.Template- based question answering over RDF data[C]//Proceedings of the 21st World Wide Web Conference.New York:ACM,2012:639-648.
[6] LI F,JAGADISH H V.Constructing an interactive natural language interface for relational databases[J].Proceedings of the VLDB Endowment,2014,8(1):73-84.
[7] ZHONG V,XIONG C,SOCHER R.Seq2SQL:GeneratingStructured Queries from Natural Language using Reinforcement Learning[J].arXiv:1709.0010.3v7.
[8] YU T,LI Z F,ZHANG Z L,et al.TypeSQL:Knowledge-Based Type-Aware Neural Text-to-SQL Generation[J].arXiv:1804.09769v1,2018.
[9] YU T,MICHIHIRO Y,KAI Y,et al.SyntaxSQLNet:Syntax Tree Networks for Complex and Cross-DomainText-to-SQL Task[J].arXiv:1810.05237v1,2018.
[10] YU T,ZHANG R,YANG K,et al.Spider:A Large-Scale Human-Labeled Dataset for Complex and Cross-Domain Semantic Parsing and Text-to-SQL Task [J].arXiv:1809.08887v5,2019.
[11] CAO J C,HUANG T,CHEN G,et al.Research on Natural Language Generating Multi-table SQL Query Statement Technology[J].Journal of Computer Science and Research,2020(7):1133-1141.
[12] ZHANG R,YU T,ER H Y,et al.Editing-Based SQL QueryGeneration for Cross-Domain Context-Dependent Questions[C]//Proceedings of the2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP).2019.
[13] BOGIN B, GARDNER M, BERANT J.Representing Schema Structure with Graph Neural Networks for Text-to-SQL Parsing[J].arXiv:1905,06241v2,2019.
[14] BOGIN B,GARDNER M,BERANT J.Global Reasoning overDatabase Structures for Text-to-SQL Parsing[J].arXiv:1908.11214v1,2019.
[15] XIE J X,GAN Y J,YU G J.Design and Implementation of Algorithms for Converting SQL Query Statements into Graph Structures[J].Electromechanical Information,2020(17):120-123.
[16] GUO J,ZHAN Z,GAO Y,et al.Towards Complex Text-to-SQL in Cross-Domain Database with Intermediate Representation[C]//Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics.2019.
[17] ASHISH V, NOAM S, NIKI P,et al.Attention is All YouNeed[J].arXiv:1706.03762.
[18] KIPF T N,WELLING M.Variational Graph Auto-Encoders[J].arXiv:1611.07308v1.
[19] YUAN Z X,REN D D,HONG X D,et al.Research on Question Understanding Method Combining Database Structure and Content[J].Computer Engineering,2021,47(3):71-76,82.
[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] GUO Lei, MA Ting-huai. Friend Closeness Based User Matching [J]. Computer Science, 2022, 49(3): 113-120.
[6] 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.
[7] 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.
[8] 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.
[9] ZHANG Ren-zhi, ZHU Yan. Malicious User Detection Method for Social Network Based on Active Learning [J]. Computer Science, 2021, 48(6): 332-337.
[10] 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.
[11] 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.
[12] 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.
[13] 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.
[14] 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.
[15] YU You-qin, LI Bi-cheng. Microblog User Interest Recognition Based on Multi-granularity Text Feature Representation [J]. Computer Science, 2021, 48(12): 219-225.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!