{'fraction_non_alphanumeric': 0.014329580348004094, 'fraction_numerical': 0.0010235414534288639, 'mean_word_length': 4.891566265060241, '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}}
Properties of predictor based on relative neighborhood graph localized FIR filters

A time signal prediction algorithm based on relative neighborhood graph (RNG) localized FIR filters is defined. The RNG connects two nodes, of input space dimension D, if their lune does not contain any other node. The FIR filters associated with the nodes, are used for local approximation of the training vectors belonging to the lunes formed by the nodes. The predictor training is carried out by iteration through 3 stages: initialization of the RNG of the training signal by vector quantization, LS estimation of the FIR filters localized in the input space by RNG nodes and adaptation of the RNG nodes by equalizing the LS approximation error among the lunes formed by the nodes of the RNG. The training properties of the predictor is exemplified on a burst signal and characterized by the normalized mean square error (NMSE) and the mean valence of the RNG nodes through the adaptation.