A fast and effective algorithm for influence maximization in large-scale independent cascade networks

2020 ◽  
Author(s):  
Paolo Scarabaggio ◽  
Raffaele Carli ◽  
Mariagrazia Dotoli
Keyword(s):  
Large Scale ◽  
Influence Maximization ◽  
Effective Algorithm ◽  
Independent Cascade

An Effective Algorithm for Large Scale Image and Terrain Data Walkthrough

2009 ◽  
Vol 11 (5) ◽  
pp. 604-609
Author(s):  
Liuqing MA ◽  
Guanfu SONG ◽  
Hui GUO ◽  
Qin ZHOU
Keyword(s):  
Large Scale ◽  
Effective Algorithm

CoFIM: A community-based framework for influence maximization on large-scale networks

2017 ◽  
Vol 117 ◽  
pp. 88-100 ◽  
Author(s):  
Jiaxing Shang ◽  
Shangbo Zhou ◽  
Xin Li ◽  
Lianchen Liu ◽  
Hongchun Wu
Keyword(s):  
Large Scale ◽  
Influence Maximization ◽  
Community Based ◽  
Large Scale Networks

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

2020 ◽  
Vol 30 (08) ◽  
pp. 1079-1096
Author(s):  
Liqing Qiu ◽  
Shuang Zhang ◽  
Chunmei Gu ◽  
Xiangbo Tian
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Heuristic Algorithms ◽  
Influence Maximization ◽  
Scalable Algorithm ◽  
Influence Spread ◽  
Efficiency And Effectiveness ◽  
Spread Of Influence ◽  
Influential Nodes ◽  
Comparison Algorithms

Influence maximization is a problem that aims to select top [Formula: see text] influential nodes to maximize the spread of influence in social networks. The classical greedy-based algorithms and their improvements are relatively slow or not scalable. The efficiency of heuristic algorithms is fast but their accuracy is unacceptable. Some algorithms improve the accuracy and efficiency by consuming a large amount of memory usage. To overcome the above shortcoming, this paper proposes a fast and scalable algorithm for influence maximization, called K-paths, which utilizes the influence tree to estimate the influence spread. Additionally, extensive experiments demonstrate that the K-paths algorithm outperforms the comparison algorithms in terms of efficiency while keeping competitive accuracy.

Neural Network Algorithm for Solving Large Scale Travelling Salesman Problems

2012 ◽  
Vol 542-543 ◽  
pp. 1398-1402
Author(s):  
Guo Zhong Cheng ◽  
Wei Feng ◽  
Fang Song Cui ◽  
Shi Lu Zhang
Keyword(s):  
Neural Network ◽  
Time Complexity ◽  
Large Scale ◽  
Travelling Salesman Problem ◽  
Effective Algorithm ◽  
Travelling Salesman ◽  
Satisfactory Solution ◽  
Network Algorithm ◽  
The Neural Network ◽  
Neural Network Algorithm

This study improves the neural network algorithm that was presented by J.J.Hopfield for solving TSP(travelling salesman problem) and gets an effective algorithm whose time complexity is O(n*n), so we can solve quickly TSP more than 500 cities in microcomputer. The paper considers the algorithm based on the replacement function of the V Value. The improved algorithm can greatly reduces the time and space complexities of Hopfield method. The TSP examples show that the proposed algorithm could efficiently find a satisfactory solution and has a fast convergence speed.

Sign in / Sign up

Export Citation Format

Share Document