Computational Geometry: Theory and Applications
Analyzing Relative Motion within Groups of Trackable Moving Point Objects
GIScience '02 Proceedings of the Second International Conference on Geographic Information Science
Geographic Data Mining and Knowledge Discovery
Geographic Data Mining and Knowledge Discovery
The skip quadtree: a simple dynamic data structure for multidimensional data
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Computing longest duration flocks in trajectory data
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Dimensionality reduction for long duration and complex spatio-temporal queries
Proceedings of the 2007 ACM symposium on Applied computing
DASFAA'06 Proceedings of the 11th international conference on Database Systems for Advanced Applications
Detecting Regular Visit Patterns
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Detecting single file movement
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
On-line discovery of flock patterns in spatio-temporal data
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Efficiently detecting clusters of mobile objects in the presence of dense noise
Proceedings of the 2010 ACM Symposium on Applied Computing
SSDBM'10 Proceedings of the 22nd international conference on Scientific and statistical database management
Detecting areas visited regularly
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Exploring real mobility data with M-atlas
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Detecting movement patterns with wireless sensor networks: application to bird behavior
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
MoveMine: Mining moving object data for discovery of animal movement patterns
ACM Transactions on Intelligent Systems and Technology (TIST)
Unveiling the complexity of human mobility by querying and mining massive trajectory data
The VLDB Journal — The International Journal on Very Large Data Bases
A GPU approach to subtrajectory clustering using the Fréchet distance
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Efficient event detection by exploiting crowds
Proceedings of the 7th ACM international conference on Distributed event-based systems
Semantic trajectories modeling and analysis
ACM Computing Surveys (CSUR)
Mining group movement patterns
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Algorithms for hotspot computation on trajectory data
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
A framework of traveling companion discovery on trajectory data streams
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
Hi-index | 0.00 |
Data representing moving objects is rapidly getting more available, especially in the area of wildlife GPS tracking. It is a central belief that information is hidden in large data sets in the form of interesting patterns, where a pattern can be any configuration of some moving objects in a certain area and/or during a certain time period. One of the most common spatio-temporal patterns sought after is flocks. A flock is a large enough subset of objects moving along paths close to each other for a certain pre-defined time. We give a new definition that we argue is more realistic than the previous ones, and by the use of techniques from computational geometry we present fast algorithms to detect and report flocks. The algorithms are analysed both theoretically and experimentally.