I-COLLIDE: an interactive and exact collision detection system for large-scale environments
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
SIGGRAPH '96 ACM SIGGRAPH 96 Visual Proceedings: The art and interdisciplinary programs of SIGGRAPH '96
Locally adaptive dimensionality reduction for indexing large time series databases
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Efficient k-NN search on vertically decomposed data
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Trajectory Segmentation Using Dynamic Programming
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 1 - Volume 1
Indexing multi-dimensional time-series with support for multiple distance measures
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
A trajectory splitting model for efficient spatio-temporal indexing
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Modeling Multiple Time Series for Anomaly Detection
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Predicting future locations using clusters' centroids
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Interactive mining and semantic retrieval of videos
Proceedings of the 8th international workshop on Multimedia data mining: (associated with the ACM SIGKDD 2007)
On-line discovery of hot motion paths
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
On efficiently searching trajectories and archival data for historical similarities
Proceedings of the VLDB Endowment
Trajectory Voting and Classification Based on Spatiotemporal Similarity in Moving Object Databases
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Which Distance for the Identification and the Differentiation of Cell-Cycle Expressed Genes?
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
Querying trajectories using flexible patterns
Proceedings of the 13th International Conference on Extending Database Technology
Pattern Recognition Letters
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Top-k queries on temporal data
The VLDB Journal — The International Journal on Very Large Data Bases
Anomaly detection for travelling individuals with cognitive impairments
ACM SIGACCESS Accessibility and Computing
Unsupervised trajectory sampling
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Similarity in (spatial, temporal and) spatio-temporal datasets
Proceedings of the 15th International Conference on Extending Database Technology
An adaptive approach for online segmentation of multi-dimensional mobile data
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Proceedings of the VLDB Endowment
Optimal splitters for temporal and multi-version databases
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Warped K-Means: An algorithm to cluster sequentially-distributed data
Information Sciences: an International Journal
Hi-index | 0.00 |
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primitives that are better suited for storage and retrieval purposes. Previous work on trajectory segmentation attacked the problem locally, segmenting separately each trajectory of the database. Therefore, they did not directly optimize the inter-object separability, which is necessary for mining operations such as searching, clustering, and classification on large databases. In this paper we analyze the trajectory segmentation problem from a global perspective, utilizing data aware distance-based optimization techniques, which optimize pairwise distance estimates hence leading to more efficient object pruning. We first derive exact solutions of the distance-based formulation. Due to the intractable complexity of the exact solution, we present anapproximate, greedy solution that exploits forward searching of locally optimal solutions. Since the greedy solution also imposes a prohibitive computational cost, we also put forward more light weight variance-based segmentation techniques, which intelligently "relax" the pairwise distance only in the areas that affect the least the mining operation.