{'fraction_non_alphanumeric': 0.011651816312542838, 'fraction_numerical': 0.0, 'mean_word_length': 4.959183673469388, '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 ranking measure for top-k moving object trajectories search

In this paper we present a new ranking measure for Top-k Trajectory query. A trajectory is defined as a sequence of places with each place having an associated text description with them. A top-k trajectory query consists of a set of locations and a set of activities, and returns a set of relevant trajectories to a user. A trajectory is considered more relevant if it has query activities at places nearby to the query locations. The proposed ranking measure helps to select highly relevant trajectories by capturing the correlation between trajectory places and activities while computing a trajectory relevance score. Previous works on Top-k trajectory query computed a trajectory relevance score either on the basis of spatial proximity or on the basis of combination of spatial proximity and textual similarity in some user defined proportion. These works did not consider association of spatial and textual dimensions, and hence may return trajectories that have query activities at trajectory places very far away from the query locations. In addition to the proposal of a ranking metric, we also give an algorithm to implement the proposed metric efficiently. Finally, we do an experimental study on a real dataset to demonstrate that the proposed ranking measure is indeed effective in terms of retrieval of trajectories that have query activities at places near to the query locations.