Trajectory big data processing based on frequent activity

Abstract

With the rapid development and wide use of Global Positioning System in technology tools, such as smart phones and touch pads, many people share their personal experience through their trajectories while visiting places of interest. Therefore, trajectory query processing has emerged in recent years to help users find their best trajectories. However, with the huge amount of trajectory points and text descriptions, such as the activities practiced by users at these points, organizing these data in the index becomes tedious. Therefore, the parallel method becomes indispensable. In this paper, we have investigated the problem of distributed trajectory query processing based on the distance and frequent activities. The query is specified by start and final points in the trajectory, the distance threshold, and a set of frequent activities involved in the point of interest of the trajectory.As a result, the query returns the shortest trajectory including the most frequent activities with high support and high confidence. To simplify the query processing, we have implemented the Distributed Mining Trajectory R-Tree index (DMTR-Tree). For this method, we initially managed the large trajectory dataset in distributed R-Tree indexes.Then, for each index, we applied the frequent itemset Apriori algorithm for each point to select the frequent activity set. For the faster computation of the above algorithms, we utilized the cluster computing framework of Apache Spark with MapReduce as the programing model. The experimental results show that the DMTR-Tree index and the query-processing algorithm are efficient and can achieve the scalability.

Personal Trajectory with Ring Structure Network: Algorithms and Experiments

“…ere are different types of moving objects that can be tracked, such as people, vehicles, and animals. Tracking these objects generates a set of trajectories and some questions of which the solutions can be used in some application fields [24][25][26][28][29][30][31][32][33][34][35][36][37], 7 of them focus on the trajectory mining [26,28,[30][31][32][33][34], and 5 of them focus on the structure of the trajectory networks.…”

Efficient Algorithms for Maximizing Group Influence in Social Networks

“…With the significant development in Internet technology, big data, and communication technology, including mobile and pervasive computing paradigm, communication between users has become more convenient due to the continuous advancement of Internet technology [1,2] . Consequently, social activities are growing on the internet, with an increasing number Peihuang Huang is with the College of Mathematics and Data Science, Minjiang University, Fuzhou 350108, China.…”

Sampling-based approximate skyline query in sensor equipped IoT networks

“…Smart city networks should collect sensory data from all over the city in order to provide better information. Therefore, to collect such well spread data and interpret information at the city level, they exploit various sensor-equipped devices in the city [4,5] .…”