{'fraction_non_alphanumeric': 0.016666666666666666, 'fraction_numerical': 0.0, 'mean_word_length': 5.673611111111111, '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}}
Recursive EM algorithm for finite mixture models with application to Internet traffic modeling

In the past decade, many quantities characterizing high-speed telecommunication network performance have been reported to have heavy-tailed distributions, namely, with tails decreasing hyperbolically rather than exponentially. Since mixture distributions can approximate many heavy-tailed distributions with high precision, the paper uses mixture distributions to model Internet traffic and applies the EM algorithm to fit the models. Making use of the fact that, at each iteration of the EM algorithm, the parameter increment has a positive projection on the gradient of the likelihood function, the paper proposes a recursive EM algorithm to fit the models, and the Bayesian information criterion is applied to select the best model. To illustrate the efficiency of the proposed algorithm, numerical results and experimental results on real traffic are provided.