{'fraction_non_alphanumeric': 0.008350730688935281, 'fraction_numerical': 0.0, 'mean_word_length': 5.153846153846154, '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}}
Self-Organizing Maps for Structured Data

In this paper we are interested in discovering similarities among complex objects which can reasonably be represented by labelled acyclic directed graphs. We show that it is possible to extend the SOM model to study this type of structured inputs. We demonstrate the capabilities of the proposed model by utilizing a relatively large data set taken from an artificial benchmark problem involving visual patterns encoded as labelled DAGs.