Abstract
The efficient analysis of spatio-temporal data, generated by moving objects, is an essential requirement for intelligent location-based services. Spatio-temporal rules can be found by constructing spatio-temporal baskets, from which traditional association rule mining methods can discover spatio-temporal rules. When the items in the baskets are spatio-temporal identifiers and are derived from trajectories of moving objects, the discovered rules represent frequently travelled routes. For some applications, e.g., an intelligent ridesharing application, these frequent routes are only interesting if they are long and sharable, i.e., can potentially be shared by several users. This paper presents a database projection based method for efficiently extracting such long, sharable frequent routes. The method prunes the search space by making use of the minimum length and sharable requirements and avoids the generation of the exponential number of sub-routes of long routes. Considering alternative modelling options for trajectories, leads to the development of two effective variants of the method. SQL-based implementations are described, and extensive experiments on both real life- and large-scale synthetic data show the effectiveness of the method and its variants.
Similar content being viewed by others
References
R. Agrawal, T. Imilienski, and A. Swami. “Mining association rules between sets of items in large databases,” in Proc. of SIGMOD, pp. 207–216, 1993.
R. Agrawal and R. Srikant. “Fast algorithms for mining association rules,” in Proc. of VLDB, pp. 487–499, 1994.
R. Agrawal and R. Srikant. “Mining sequential patterns,” in Proc. of ICDE, pp. 3–14, 1995.
D. Burdick, M. Calimlim, and J. Gehrke. “MAFIA: A maximal frequent itemset algorithm for transactional databases,” in Proc. of ICDE, pp. 443–452, 2001.
G. Gidófalvi and T.B. Pedersen. “Spatio-temporal rule mining: Issues and techniques,” in Proc. of DaWaK, pp. 275–284, 2005.
G. Gidófalvi and T.B. Pedersen. “ST–ACTS: A spatio-temporal activity simulator,” in Proc. of ACM-GIS, pp. 155–162, 2006.
G. Gidófalvi and T.B. Pedersen. “Cab–sharing: An effective, door–to–door, on–demand transportation service,” in Proc. of ITS, 2007.
B. Goethals. “Survey on frequent pattern mining,” in http://citeseer.ist.psu.edu/goethals03survey.html, 2003.
M.L Gosseling and S. Doherty. Integrated Land-Use and Transportation Models, Behavioural Foundations. Elsevier, 2005.
K. Gouda and M.J. Zaki. “GenMax: An efficient algorithm for mining maximal frequent itemsets,” in Data Mining and Knowledge Discovery, Vol. 11(3):223–242, 2005.
C.S. Jensen, D. Pfoser, and Y. Theodoridis. “Novel approaches to the indexing of moving object trajectories,” in Proc. of VLDB, pp. 395–406, 2000.
C.S. Jensen, H. Lahrmann, S. Pakalnis, and S. Runge. “The INFATI data.” Time Center TR–79,” in www.cs.aau.dk/TimeCenter, 2004.
N. Mamoulis, H. Cao, G. Kollios, M. Hadjieleftheriou, Y. Tao, and D. W. Cheung. “Mining, indexing, and querying historical spatiotemporal data,” in Proc. of KDD, pp. 236–245, 2004.
J. Pei, J. Han, and R. Mao. “CLOSET: An efficient algorithm for mining frequent closed itemsets,” in Proc. of DMKD, pp. 11–20, 2000.
M. Quddus, W. Ochieng, L. Zhao, and R. Noland. “A general map matching algorithm for transport telematics applications,” in GPS Solutions Journal, Vol. 7(3):157–167, 2003.
X. Shang, K.-U. Sattler, and I. Geist. “Efficient frequent pattern mining in relational databases” in Proc. of LWA, pp. 84–91, 2004.
I. Tsoukatos and D. Gunopulos. “Efficient mining of spatiotemporal patterns,” in Proc. of SSTD, pp. 425–442, 2001.
M. Vlachos, D. Gunopoulos, and G. Kollios. “Discovering similar multidimensional trajectories,” in Proc. of ICDE, pp. 673–685, 2002.
J. Wang, J. Han, and J. Pei. “CLOSET+: Searching for the best strategies for mining frequent closed itemsets,” in Proc. of KDD, pp. 236–245, 2003.
D. Xin, J. Han, X. Yan, and H. Cheng. “Mining compressed frequent-pattern sets,” in Proc. of VLDB, pp. 709–720, 2005.
X. Yan, J. Han, and R. Afshar. “CloSpan: Mining closed sequential patterns in large datasets.” in Proc. of SDM, pp. 166–177, 2003.
M.J. Zaki and C.J. Hsiao. “CHARM: an efficient algorithm for closed itemset mining,” in Proc. of SDM, pp. 71–80, 2002.
Acknowledgements
This work was supported in part by the Danish Ministry of Science, Technology, and Innovation under grant number 61480.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gidófalvi, G., Pedersen, T.B. Mining Long, Sharable Patterns in Trajectories of Moving Objects. Geoinformatica 13, 27–55 (2009). https://doi.org/10.1007/s10707-007-0042-z
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10707-007-0042-z