{'fraction_non_alphanumeric': 0.02390998593530239, 'fraction_numerical': 0.0, 'mean_word_length': 4.788617886178862, '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}}
On Classifying Dynamic Graph Bags

In this paper, we introduce a novel problem of dynamic graph bag classification, and propose a method to solve this problem. Here, a graph bag (simply, bag) corresponds to a training object that contains one or multiple graphs. Dynamic bag classification aims to build a classification model for bags which are presented in a dynamic fashion, i.e., emerging of new bags or graphs. Our proposed solution for this problem can gradually update the classification model whenever such changes are made to a bag dataset, rather than building a model from the scratch. We demonstrate the effectiveness of our proposed method by our extensive evaluation on a real-world graph dataset.