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

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.

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.

Heterogeneous Influence Maximization Through Community Detection in Social Networks

2021 ◽  
Vol 12 (4) ◽  
pp. 118-131
Author(s):  
Jaya Krishna Raguru ◽  
Devi Prasad Sharma
Keyword(s):  
Community Detection ◽  
Greedy Algorithms ◽  
Computational Cost ◽  
Optimal Solution ◽  
Influence Maximization ◽  
Centrality Measures ◽  
Influence Spread ◽  
Real World Datasets ◽  
Initial Seed ◽  
High Computational Cost

The problem of identifying a seed set composed of K nodes that increase influence spread over a social network is known as influence maximization (IM). Past works showed this problem to be NP-hard and an optimal solution to this problem using greedy algorithms achieved only 63% of spread. However, this approach is expensive and suffered from performance issues like high computational cost. Furthermore, in a network with communities, IM spread is not always certain. In this paper, heterogeneous influence maximization through community detection (HIMCD) algorithm is proposed. This approach addresses initial seed nodes selection in communities using various centrality measures, and these seed nodes act as sources for influence spread. A parallel influence maximization is applied with the aid of seed node set contained in each group. In this approach, graph is partitioned and IM computations are done in a distributed manner. Extensive experiments with two real-world datasets reveals that HCDIM achieves substantial performance improvement over state-of-the-art techniques.

scholarly journals Novel Node Centrality-Based Efficient Empirical Robustness Assessment for Directed Network

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Xiaolong Deng ◽  
Hao Ding ◽  
Yong Chen ◽  
Cai Chen ◽  
Tiejun Lv
Keyword(s):  
Social Network ◽  
Vulnerability Assessment ◽  
Online Social Networks ◽  
Information Transfer ◽  
Large Scale ◽  
Real Life ◽  
Clustering Coefficient ◽  
Network Robustness ◽  
Directed Network ◽  
Online Social Media

In recent years, while extensive researches on various networks properties have been proposed and accomplished, little has been proposed and done on network robustness and node vulnerability assessment under cascades in directed large-scale online community networks. In essential, an online directed social network is a group-centered and information spread-dominated online platform which is very different from the traditional undirected social network. Some further research studies have indicated that the online social network has high robustness to random removals of nodes but fails to the intentional attacks, particularly to those attacks based on node betweenness or node directed coefficient. To explore on the robustness of directed social network, in this article, we have proposed two novel node centralities of ITG (information transfer gain-based probability clustering coefficient) and I M p v (directed path-based node importance centrality). These two new centrality models are designed to capture this cascading effect in directed online social networks. Furthermore, we also propose a new and highly efficient computing method based on iterations for I M p v . Then, with the abundant experiments on the synthetic signed network and real-life networks derived from directed online social media and directed human mobile phone calling network, it has been proved that our ITG and I M p v based on directed social network robustness and node vulnerability assessment method is more accurate, efficient, and faster than several traditional centrality methods such as degree and betweenness. And we also have proposed the solid reasoning and proof process of iteration times k in computation of I M p v . To the best knowledge of us, our research has drawn some new light on the leading edge of robustness on the directed social network.

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.

Prediction of Social Influence for Provenance of Misinformation in Online Social Network Using Big Data Approach

2020 ◽  
Author(s):  
Kumaran P ◽  
Rajeswari Sridhar
Keyword(s):  
Social Networks ◽  
Social Network ◽  
Law Enforcement ◽  
Online Social Networks ◽  
Large Scale ◽  
Online Social Network ◽  
Root Cause ◽  
Minimum Number ◽  
Targeted Marketing ◽  
Implicit And Explicit

Abstract Online social networks (OSNs) is a platform that plays an essential role in identifying misinformation like false rumors, insults, pranks, hoaxes, spear phishing and computational propaganda in a better way. Detection of misinformation finds its applications in areas such as law enforcement to pinpoint culprits who spread rumors to harm the society, targeted marketing in e-commerce to identify the user who originates dissatisfaction messages about products or services that harm an organizations reputation. The process of identifying and detecting misinformation is very crucial in complex social networks. As misinformation in social network is identified by designing and placing the monitors, computing the minimum number of monitors for detecting misinformation is a very trivial work in the complex social network. The proposed approach determines the top suspected sources of misinformation using a tweet polarity-based ranking system in tandem with sarcasm detection (both implicit and explicit sarcasm) with optimization approaches on large-scale incomplete network. The algorithm subsequently uses this determined feature to place the minimum set of monitors in the network for detecting misinformation. The proposed work focuses on the timely detection of misinformation by limiting the distance between the suspected sources and the monitors. The proposed work also determines the root cause of misinformation (provenance) by using a combination of network-based and content-based approaches. The proposed work is compared with the state-of-art work and has observed that the proposed algorithm produces better results than existing methods.

scholarly journals A novel approach for fast and effective influence spread maximization in social networks

2020 ◽  
Author(s):  
Paolo Scarabaggio ◽  
Raffaele Carli ◽  
Mariagrazia Dotoli
Keyword(s):  
Social Networks ◽  
Large Scale ◽  
Influence Maximization ◽  
Viral Marketing ◽  
Computational Time ◽  
Maximization Problem ◽  
Influence Spread ◽  
The Social ◽  
Spread Of Influence ◽  
Influence Maximization Problem

The main characteristic of social networks is their ability to quickly spread information between a large group of people. This phenomenon is generated by the social influence that individuals induce on each other.<br>The widespread use of online social networks (e.g., Facebook) increases researchers' interest in how influence propagates through these networks. One of the most important research issues in this field is the so-called influence maximization problem, which essentially consists in selecting the most influential users (i.e., those who are able to maximize the spread of influence through the social network).<br>Due to its practical importance in various applications (e.g., viral marketing, target advertisement, personalized recommendation), such a problem has been studied in several variants. Different solution methodologies have been proposed. Nevertheless, the current open challenge in the resolution of the influence maximization problem still concerns achieving a good trade-off between accuracy and computational time. <br>In this context, based on the well-known independent cascade and the linear threshold models of social networks, we propose a novel low-complexity and highly accurate algorithm for selecting an initial group of nodes to maximize the spread of influence in large-scale networks. In particular, the key idea consists in iteratively removing the overlap of influence spread induced by different seed nodes. Application to several numerical experiments based on real datasets proves that the proposed algorithm effectively finds practical near-optimal solutions of the addressed influence maximization problem in a computationally efficient fashion. Finally, comparison with the best performing state of the art algorithms demonstrates that in large scale scenarios, the proposed approach shows higher performance in terms of influence spread and running time.

Sign in / Sign up

Export Citation Format

Share Document