Parallel Greedy Algorithm to Multiple Influence Maximization in Social Network

2021 ◽  
Vol 15 (3) ◽  
pp. 1-21
Author(s):  
Guanhao Wu ◽  
Xiaofeng Gao ◽  
Ge Yan ◽  
Guihai Chen
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Parallel Algorithms ◽  
Real World ◽  
Online Social Networks ◽  
Heuristic Algorithms ◽  
Influence Maximization ◽  
Memory Overhead ◽  
Influence Spread ◽  
Real World Applications

Influence Maximization (IM) problem is to select influential users to maximize the influence spread, which plays an important role in many real-world applications such as product recommendation, epidemic control, and network monitoring. Nowadays multiple kinds of information can propagate in online social networks simultaneously, but current literature seldom discuss about this phenomenon. Accordingly, in this article, we propose Multiple Influence Maximization (MIM) problem where multiple information can propagate in a single network with different propagation probabilities. The goal of MIM problems is to maximize the overall accumulative influence spreads of different information with the limit of seed budget . To solve MIM problems, we first propose a greedy framework to solve MIM problems which maintains an -approximate ratio. We further propose parallel algorithms based on semaphores, an inter-thread communication mechanism, which significantly improves our algorithms efficiency. Then we conduct experiments for our framework using complex social network datasets with 12k, 154k, 317k, and 1.1m nodes, and the experimental results show that our greedy framework outperforms other heuristic algorithms greatly for large influence spread and parallelization of algorithms reduces running time observably with acceptable memory overhead.

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.

scholarly journals Influence Maximization with Priority in Online Social Networks

Algorithms ◽  
2020 ◽  
Vol 13 (8) ◽  
pp. 183
Author(s):  
Canh V. Pham ◽  
Dung K. T. Ha ◽  
Quang C. Vu ◽  
Anh N. Su ◽  
Huan X. Hoang
Keyword(s):  
Social Network ◽  
Online Social Networks ◽  
Sampling Method ◽  
State Of The Art ◽  
Influence Maximization ◽  
Approximation Solution ◽  
Worst Case ◽  
New Approach ◽  
Influence Spread ◽  
Seed Collections

The Influence Maximization (IM) problem, which finds a set of k nodes (called seedset) in a social network to initiate the influence spread so that the number of influenced nodes after propagation process is maximized, is an important problem in information propagation and social network analysis. However, previous studies ignored the constraint of priority that led to inefficient seed collections. In some real situations, companies or organizations often prioritize influencing potential users during their influence diffusion campaigns. With a new approach to these existing works, we propose a new problem called Influence Maximization with Priority (IMP) which finds out a set seed of k nodes in a social network to be able to influence the largest number of nodes subject to the influence spread to a specific set of nodes U (called priority set) at least a given threshold T in this paper. We show that the problem is NP-hard under well-known IC model. To find the solution, we propose two efficient algorithms, called Integrated Greedy (IG) and Integrated Greedy Sampling (IGS) with provable theoretical guarantees. IG provides a 1−(1−1k)t-approximation solution with t is an outcome of algorithm and t≥1. The worst-case approximation ratio is obtained when t=1 and it is equal to 1/k. In addition, IGS is an efficient randomized approximation algorithm based on sampling method that provides a 1−(1−1k)t−ϵ-approximation solution with probability at least 1−δ with ϵ>0,δ∈(0,1) as input parameters of the problem. We conduct extensive experiments on various real networks to compare our IGS algorithm to the state-of-the-art algorithms in IM problem. The results indicate that our algorithm provides better solutions interns of influence on the priority sets when approximately give twice to ten times higher than threshold T while running time, memory usage and the influence spread also give considerable results compared to the others.

Understanding Weight Change Behaviors through Online Social Networks

2011 ◽  
Vol 2 (3) ◽  
pp. 46-69 ◽  
Author(s):  
Xiaoxiao Ma ◽  
Guanling Chen ◽  
Juntao Xiao
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Social Influence ◽  
Empirical Analysis ◽  
Real World ◽  
Weight Change ◽  
Online Social Networks ◽  
Community Support ◽  
Propagation Distance ◽  
Weight Changes

Online Social Networks (OSNs) provide a good way to make connections with people with similar interests and goals. In particular, health-centered OSNs are emerging to provide knowledge and support for those interested in managing their own health. This paper provides an empirical analysis of a health OSN, which allows its users to record their foods and exercises, track their diet progress toward weight-change goals, and socialize and group with each other for community support. Based on about five month data collected from more than 107,000 users, the authors studied their weigh-in behaviors and tracked their weight-change progress. The authors found that the users’ weight changes correlated positively with the number of weigh-ins, the number of their friends, and their friends’ weight-change performance. The authors also show that the users’ weight changes have rippling effects in the OSN due to social influence. The strength of such online influence and its propagation distance appear to be greater than those in a real-world social network.

scholarly journals Influence Maximization Based on Backward Reasoning in Online Social Networks

Mathematics ◽  
2021 ◽  
Vol 9 (24) ◽  
pp. 3189
Author(s):  
Lin Zhang ◽  
Kan Li
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Online Social Networks ◽  
Information Diffusion ◽  
Online Social Network ◽  
Rapid Development ◽  
Influence Maximization ◽  
Research Issues ◽  
Backward Reasoning ◽  
New Framework

Along with the rapid development of information technology, online social networks have become more and more popular, which has greatly changed the way of information diffusion. Influence maximization is one of the hot research issues in online social network analysis. It refers to mining the most influential top-K nodes from an online social network to maximize the final propagation of influence in the network. The existing studies have shown that the greedy algorithms can obtain a highly accurate result, but its calculation is time-consuming. Although heuristic algorithms can improve efficiency, it is at the expense of accuracy. To balance the contradiction between calculation accuracy and efficiency, we propose a new framework based on backward reasoning called Influence Maximization Based on Backward Reasoning. This new framework uses the maximum influence area in the network to reversely infer the most likely seed nodes, which is based on maximum likelihood estimation. The scheme we adopted demonstrates four strengths. First, it achieves a balance between the accuracy of the result and efficiency. Second, it defines the influence cardinality of the node based on the information diffusion process and the network topology structure, which guarantees the accuracy of the algorithm. Third, the calculation method based on message-passing greatly reduces the computational complexity. More importantly, we applied the proposed framework to different types of real online social network datasets and conducted a series of experiments with different specifications and settings to verify the advantages of the algorithm. The results of the experiments are very promising.

Understanding Weight Change Behaviors through Online Social Networks

2012 ◽  
pp. 189-214
Author(s):  
Xiaoxiao Ma ◽  
Guanling Chen ◽  
Juntao Xiao
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Social Influence ◽  
Empirical Analysis ◽  
Real World ◽  
Weight Change ◽  
Online Social Networks ◽  
Community Support ◽  
Propagation Distance ◽  
Weight Changes

Online Social Networks (OSNs) provide a good way to make connections with people with similar interests and goals. In particular, health-centered OSNs are emerging to provide knowledge and support for those interested in managing their own health. This paper provides an empirical analysis of a health OSN, which allows its users to record their foods and exercises, track their diet progress toward weight-change goals, and socialize and group with each other for community support. Based on about five month data collected from more than 107,000 users, the authors studied their weigh-in behaviors and tracked their weight-change progress. The authors found that the users’ weight changes correlated positively with the number of weigh-ins, the number of their friends, and their friends’ weight-change performance. The authors also show that the users’ weight changes have rippling effects in the OSN due to social influence. The strength of such online influence and its propagation distance appear to be greater than those in a real-world social network.

Taxonomy of Influence Maximization Techniques in Unknown Social Networks

2021 ◽  
pp. 351-363
Author(s):  
B. Bazeer Ahamed ◽  
Sudhakaran Periakaruppan
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Online Social Networks ◽  
Graph Mining ◽  
Influence Maximization ◽  
Business Strategies ◽  
The Social ◽  
Spread Of Influence ◽  
Maximization Algorithms ◽  
Real Challenge

Influence maximization in online social networks (OSNs) is the problem of discovering few nodes or users in the social network termed as ‘seed nodes', which can help the spread of influence in the network. With the tremendous growth in social networking, the influence exerted by users of a social network on other online users has caught the attention of researchers to develop effective influence maximization algorithms to be applied in the field of business strategies. The main application of influence maximization is promoting the product to a set of users. However, a real challenge in influence maximization algorithms to deal with enormous amount of users or nodes obtainable in any OSN is posed. The authors focused on graph mining of OSNs for generating ‘seed sets' using standard influence maximization techniques. Many standard influence maximization models are used for calculation of spread of influence; a novel influence maximization technique, namely the DegGreedy technique, has been illustrated along with experimental results to make a comparative analysis of the existing techniques.

scholarly journals Vulnerabilities to Online Social Network Identity Deception Detection Research and Recommendations for Mitigation

2020 ◽  
Vol 12 (9) ◽  
pp. 148 ◽  
Author(s):  
Max Ismailov ◽  
Michail Tsikerdekis ◽  
Sherali Zeadally
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Real World ◽  
Online Social Networks ◽  
Laboratory Experiments ◽  
Deception Detection ◽  
State Of The Art ◽  
Online Social Network ◽  
Ongoing Research ◽  
The Real

Identity deception in online social networks is a pervasive problem. Ongoing research is developing methods for identity deception detection. However, the real-world efficacy of these methods is currently unknown because they have been evaluated largely through laboratory experiments. We present a review of representative state-of-the-art results on identity deception detection. Based on this analysis, we identify common methodological weaknesses for these approaches, and we propose recommendations that can increase their effectiveness for when they are applied in real-world environments.

scholarly journals On the Shoulders of Giants: Incremental Influence Maximization in Evolving Social Networks

Complexity ◽  
2017 ◽  
Vol 2017 ◽  
pp. 1-14 ◽  
Author(s):  
Xiaodong Liu ◽  
Xiangke Liao ◽  
Shanshan Li ◽  
Si Zheng ◽  
Bin Lin ◽  
...  
Keyword(s):  
Social Networks ◽  
Real World ◽  
Search Space ◽  
Influence Maximization ◽  
Viral Marketing ◽  
Maximization Problem ◽  
Dynamic Social Networks ◽  
Influence Spread ◽  
The Impact ◽  
Influential Individuals

Influence maximization problem aims to identify the most influential individuals so as to help in developing effective viral marketing strategies over social networks. Previous studies mainly focus on designing efficient algorithms or heuristics on a static social network. As a matter of fact, real-world social networks keep evolving over time and a recalculation upon the changed network inevitably leads to a long running time. In this paper, we propose an incremental approach, IncInf, which can efficiently locate the top-K influential individuals in evolving social networks based on previous information instead of calculation from scratch. In particular, IncInf quantitatively analyzes the influence spread changes of nodes by localizing the impact of topology evolution to only local regions, and a pruning strategy is further proposed to narrow the search space into nodes experiencing major increases or with high degrees. To evaluate the efficiency and effectiveness, we carried out extensive experiments on real-world dynamic social networks: Facebook, NetHEPT, and Flickr. Experimental results demonstrate that, compared with the state-of-the-art static algorithm, IncInf achieves remarkable speedup in execution time while maintaining matching performance in terms of influence spread.

scholarly journals Trilateral Spearman Katz Centrality Based Least Angle Regression for Influential Node Tracing in Social Network

2021 ◽  
Author(s):  
VIMAL KUMAR P. ◽  
Balasubramanian C.
Keyword(s):  
Social Network ◽  
Online Social Networks ◽  
Large Scale ◽  
Information Dissemination ◽  
Influence Maximization ◽  
Centrality Measures ◽  
Least Angle Regression ◽  
Influence Spread ◽  
Katz Centrality ◽  
Influential Node

Abstract With the epidemic growth of online social networks (OSNs), a large scale research on information dissemination in OSNs has been made an appearance in contemporary years. One of the essential researches is influence maximization (IM). Most research adopts community structure, greedy stage, and centrality measures, to identify the influence node set. However, the time consumed in analyzing the influence node set for edge server placement, service migration and service recommendation is ignored in terms of propagation delay. Considering the above analysis, we concentrate on the issue of time-sensitive influence maximization and maximize the targeted influence spread. To solve the problem, we propose a method called, Trilateral Spearman Katz Centrality-based Least Angle Regression (TSKC-LAR) for influential node tracing in social network is proposed. Besides, two algorithms are used in our work to find the influential node in social network with maximum influence spread and minimal time, namely Trilateral Statistical Node Extraction algorithm and Katz Centrality Least Angle Influence Node Tracing algorithm, respectively. Extensive experiments on The Telecom dataset demonstrate the efficiency and influence performance of the proposed algorithms on evaluation metrics, namely, sensitivity, specificity, accuracy, time and influence spread

Sign in / Sign up

Export Citation Format

Share Document