{'fraction_non_alphanumeric': 0.013333333333333334, 'fraction_numerical': 0.0, 'mean_word_length': 4.669811320754717, '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}}
Simple and unbiased kernel function for network analysis

This paper proposes a new kernel function on networks which has desired properties for the analysis of density of event occurances on the networks. Our proposal is an extension of an existing kernel function called the equal-split kernel function. This function is simple, but is valid only when the lengths of all the cycles are larger than the width of the support of the kernel function. In this paper, we modify the equal-split kernel function in such a way that the unbiasedness is guaranteed even if the network contains shorter cycles.