论文信息 - Scalable Influence Maximization Meets Efficiency and Effectiveness in Large-Scale Social Networks - 字舞流文

Scalable Influence Maximization Meets Efficiency and Effectiveness in Large-Scale Social Networks

Influence maximization is a problem that aims to select top k influential nodes to maximize the spread of influence in social networks. The classical greedy-based algorithms and their improvements ...

Shuang Zhang | Liqing Qiu | Xiangbo Tian | Chunmei Gu

[1] Ludovic Lietard,et al. Two evidential data based models for influence maximization in Twitter , 2017, Knowl. Based Syst..

[2] Zhi Guo Cheng,et al. Study on the TSP Problem Based on SA Algorithm , 2014, CIT 2014.

[3] Wei Chen,et al. Scalable influence maximization for independent cascade model in large-scale social networks , 2012, Data Mining and Knowledge Discovery.

[4] MengChu Zhou,et al. A Novel Method for Detecting New Overlapping Community in Complex Evolving Networks , 2019, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[5] S. Jeevananthan,et al. Influence of crossover methods used by genetic algorithm-based heuristic to solve the selective harmonic equations (SHE) in multi-level voltage source inverter , 2015 .

[6] Lev Muchnik,et al. Identifying influential spreaders in complex networks , 2010, 1001.5285.

[7] Éva Tardos,et al. Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

[8] Yusuf Ayvaz,et al. Combined size and shape optimization of structures with a new meta-heuristic algorithm , 2015, Appl. Soft Comput..

[9] Laks V. S. Lakshmanan,et al. A Data-Based Approach to Social Influence Maximization , 2011, Proc. VLDB Endow..

[10] Junsong Yuan,et al. An efficient and effective hop-based approach for influence maximization in social networks , 2018, Social Network Analysis and Mining.