{'fraction_non_alphanumeric': 0.013831258644536652, 'fraction_numerical': 0.0, 'mean_word_length': 5.241379310344827, '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}}
Most Influential Node Selection in Social Network using Genetic Algorithm

Goal of Influence Maximization problem is to find a top-k powerful nodes as a seed set which has a maximum influence with respect to a propagation model. This is NP-hard in nature. Most of the related algorithms are based on greedy methods, which are computationally expensive. Any exhaustive search algorithm can’t discover the good solution in a sensible time. In this paper we introduce a performance oriented algorithm for solving the influence maximization problem using Greedy inspired Genetic Algorithm. We have observed that the performance of proposed algorithm is outperforming similar existing algorithms for maximizing influence Spread.