Scaling up dynamic time warping for datamining applications
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Elastic Translation Invariant Matching of Trajectories
Machine Learning
FTW: fast similarity search under the time warping distance
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards a geometric interpretation of double-cross matrix-based similarity of polylines
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Exploring movement-similarity analysis of moving objects
SIGSPATIAL Special
Finding long and similar parts of trajectories
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Finding long and similar parts of trajectories
Computational Geometry: Theory and Applications
Similarity in (spatial, temporal and) spatio-temporal datasets
Proceedings of the 15th International Conference on Extending Database Technology
Finding frequent sub-trajectories with time constraints
Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing
| Hi-index | 0.00 |
Trajectory data is becoming more and more available, opening up possibilities to subject whole sets of trajectories to data mining. The techniques for trajectory mining are only partly developed. This paper discusses new problems and solutions in the analysis of the similarity of two trajectories. Contrary to most previous research, similarity is not considered to be only shape-dependent but also time-dependent. The emphasis is on computing the most similar subtrajectories of two trajectories of some specified duration. We give polynomial time algorithms for exact or approximately most similar subtrajectories for various versions of this problem.