Mining Frequent Spatio-Temporal Sequential Patterns
Open Access
- 1 January 2005
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Many applications track the movement of mobile objects, which can be represented as sequences of timestamped locations. Given such a spatio-temporal series, we study the problem of discovering sequential patterns, which are routes frequently followed by the object. Sequential pattern mining algorithms for transaction data are not directly applicable for this setting. The challenges to address are (i) the fuzziness of locations in patterns, and (ii) the identification of non-explicit pattern instances. In this paper, we define pattern elements as spatial regions around frequent line segments. Our method first transforms the original sequence into a list of sequence segments, and detects frequent regions in a heuristic way. Then, we propose algorithms to find patterns by employing a newly proposed substring tree structure and improving Apriori technique. A performance evaluation demonstrates the effectiveness and efficiency of our approach. © 2005 IEEE.published_or_final_versioKeywords
This publication has 10 references indexed in Scilit:
- Mining, indexing, and querying historical spatiotemporal dataPublished by Association for Computing Machinery (ACM) ,2004
- Clustering of streaming time series is meaninglessPublished by Association for Computing Machinery (ACM) ,2003
- Mining sequential patternsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An online algorithm for segmenting time seriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Finding surprising patterns in a time series database in linear time and spacePublished by Association for Computing Machinery (ACM) ,2002
- Mining long sequential patterns in a noisy environmentPublished by Association for Computing Machinery (ACM) ,2002
- Efficient Mining of Spatiotemporal PatternsPublished by Springer Nature ,2001
- Levelwise Search and Borders of Theories in Knowledge DiscoveryData Mining and Knowledge Discovery, 1997
- Assessment of Line-Generalization Algorithms Using Characteristic PointsThe American Cartographer, 1985
- ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURECartographica: The International Journal for Geographic Information and Geovisualization, 1973