{'fraction_non_alphanumeric': 0.04112718964204113, 'fraction_numerical': 0.0007616146230007616, 'mean_word_length': 4.918918918918919, '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}}
Mining Bursting Communities in Temporal Graphs

Temporal graphs are ubiquitous. Mining communities that are bursting in a period of time is essential to seek emergency events in temporal graphs. Unfortunately, most previous studies for community mining in temporal networks ignore the bursting patterns of communities. In this paper, we are the first to study a problem of seeking bursting communities in a temporal graph. We propose a novel model, called (l, {\delta})-maximal dense core, to represent a bursting community in a temporal graph. Specifically, an (l, {\delta})-maximal dense core is a temporal subgraph in which each node has average degree no less than {\delta} in a time segment with length no less than l. To compute the (l, {\delta})-maximal dense core, we first develop a novel dynamic programming algorithm which can calculate the segment density efficiently. Then, we propose an improved algorithm with several novel pruning techniques to further improve the efficiency. In addition, we also develop an efficient algorithm to enumerate all (l, {\delta})-maximal dense cores that are not dominated by the others in terms of the parameters l and {\delta}. The results of extensive experiments on 9 real-life datasets demonstrate the effectiveness, efficiency and scalability of our algorithms.