{'fraction_non_alphanumeric': 0.019337016574585635, 'fraction_numerical': 0.0, 'mean_word_length': 5.775700934579439, '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}}
Sketch-based uncertain trajectories clustering

Uncertain trajectories data present new challenges to trajectories data mining. This paper proposes a sketch-based trajectory clustering algorithm for uncertain trajectories. Based on the M-level Hilbert curve spatial partitioning, a candidate segments set is constructed to represent uncertain trajectories model precisely. For the large number of candidate segments, a sketch-based approach is used to create hash-compressed clusters. A sketch-based clustering algorithm is proposed to assignment the incoming uncertain trajectory to clusters. The experiments prove that the clustering algorithm has stable accuracy with variations of the sampling rate of trajectories data.