{'fraction_non_alphanumeric': 0.019464720194647202, 'fraction_numerical': 0.0, 'mean_word_length': 5.0588235294117645, '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 Algorithms Research Based on Big Graphs

Unlike the traditional methods, such as the Independent Cascade Model and Liner Threshold Model. In this paper, we propose a kind of new Degree-priority heuristic IM algorithm in a big graph. We prove this algorithm. We do some experiments and make some comaparision between the Degree-priority heuristic IM algorithm and traditional IM algorithm.