Efficiently retrieving longest common route patterns of moving objects by summarizing turning regions
Contribuinte(s) |
Huang, J. Z. Cao, L. Srivastava, J. |
---|---|
Data(s) |
01/01/2011
|
Resumo |
The popularity of online location services provides opportunities to discover useful knowledge from trajectories of moving objects. This paper addresses the problem of mining longest common route (LCR) patterns. As a trajectory of a moving object is generally represented by a sequence of discrete locations sampled with an interval, the different trajectory instances along the same route may be denoted by different sequences of points (location, timestamp). Thus, the most challenging task in the mining process is to abstract trajectories by the right points. We propose a novel mining algorithm for LCR patterns based on turning regions (LCRTurning), which discovers a sequence of turning regions to abstract a trajectory and then maps the problem into the traditional problem of mining longest common subsequences (LCS). Effectiveness of LCRTurning algorithm is validated by an experimental study based on various sizes of simulated moving objects datasets. © 2011 Springer-Verlag. |
Identificador | |
Idioma(s) |
eng |
Publicador |
Springer |
Relação |
http://dro.deakin.edu.au/eserv/DU:30083687/huang-efficientlyretrieving-2011.pdf http://dro.deakin.edu.au/eserv/DU:30083687/huang-efficientlyretrieving-evid-2011.pdf http://www.dx.doi.org/10.1007/978-3-642-20841-6_31 |
Direitos |
2011, Springer |
Palavras-Chave | #spatial temporal data mining #trajectories of moving objects #longest common route patterns |
Tipo |
Conference Paper |