{'fraction_non_alphanumeric': 0.023942537909018357, 'fraction_numerical': 0.0, 'mean_word_length': 4.9714285714285715, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Influence Maximization Problem Approach to Model Social Networks

One of the significant problems in Social Net-works (SN) analysis is how to find the best influential members. This problem was proved to be non-deterministic polynomial (NP-hard). The influence maximization (IM) problem in SNs aims to maximize the spread of influence in the network. It represents an optimization problem. IM is a fundamental research problem in social networks. Influence maximization problem is the problem of assigning a subset of k users as (seed nodes) in a graph that could maximize the spread of influence by maximizing the expected number of influenced users. It represents a key algorithmic problem in social influence analysis. In this study, centrality-based methods are utilized to select top k nodes of high centrality values. The degree centrality is used to select the opinion leaders, while the between-ness and Eigenvector centrality is used to select the early adopters. The degree discount (as a heuristic approach) is proposed to replace the Greedy algorithms applied in other studies to avoid the time complexity. A mixed diffusion model (replacing the linear threshold and independent cascade) is utilized to be main diffusion model in this study.