{'fraction_non_alphanumeric': 0.016233766233766232, 'fraction_numerical': 0.0, 'mean_word_length': 4.92948717948718, '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}}
A DATA-MINING TECHNIQUE FOR THE PLANNING AND ORGANIZATION OF TRUCK PLATOONS

In this paper, we introduce the problem of mining frequent sub-routes for the use of platoon driving. The problem is related to the problem of mining frequent sequences. While the problem of mining frequent sequences normally focuses on patterns with a large support, the problem of mining frequent sub-routes has to deal with a small absolute support of two or more. We will present our algorithm to find truck platoon sequential pattern (TPSpan) which is based on pattern-growth methods and solves the problem of mining frequent sub-routes in an efficient way by using so called pruning parameters. We also present experimental results about the amount of possible truck platoons based on synthetic data and about the possibility of finding truck platoons with the use of pruning parameters in context of efficiency, flexibility and reliability.