{'fraction_non_alphanumeric': 0.017684887459807074, 'fraction_numerical': 0.0, 'mean_word_length': 4.877358490566038, '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-Organising Map as a Natural Kernel Method

In this paper, two recent kernel SOMs are reviewed and it is shown that the kernel SOMs can be formally derived from an energy function of the SOM in the feature space. Various kernel functions are readily applicable to the kernel SOM, while their performance and choices of kernel parameters depend on the problem. This paper shows that with a symmetric and density-type kernel function, the kernel SOM is equivalent to a homoscedastic self-organising mixture network, an entropy-based density estimator. It also explains that the SOM approximates naturally a kernel method