{'fraction_non_alphanumeric': 0.040522875816993466, 'fraction_numerical': 0.01045751633986928, 'mean_word_length': 5.436974789915967, '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}}
Comparing Diffusion Models for Graph – Based Semi – Supervised Learning

The main idea behind graph-based semi–supervised learning is to use pair–wise similarities between data instances to enhance classification accuracy (see (Zhu, 2005) for a survey of existing approaches). Many graph–based techniques use certain type of regularization that often involve a graph Laplacian operator (e.g., see (Belkin et al., 2006)). Intuitively, this corresponds to a diffusion process on graphs, where the information is propagated from the labeled instances to the rest of the nodes. Usually, this information is represented as a continuos class–membership probabilities (or scores), and the propagation process corresponds to the diffusion of those scores through the graph.