Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Time-focused clustering of trajectories of moving objects
Journal of Intelligent Information Systems
Trajectory clustering: a partition-and-group framework
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A clustering-based approach for discovering interesting places in trajectories
Proceedings of the 2008 ACM symposium on Applied computing
Mining interesting locations and travel sequences from GPS trajectories
Proceedings of the 18th international conference on World wide web
Clustering Trajectories of Moving Objects in an Uncertain World
ICDM '09 Proceedings of the 2009 Ninth IEEE International Conference on Data Mining
Mining significant semantic locations from GPS data
Proceedings of the VLDB Endowment
Finding Regions of Interest from Trajectory Data
MDM '11 Proceedings of the 2011 IEEE 12th International Conference on Mobile Data Management - Volume 01
Nearest neighbor search on moving object trajectories
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Points-of-Interest Mining from People's Photo-Taking Behavior
HICSS '13 Proceedings of the 2013 46th Hawaii International Conference on System Sciences
Mining Points-of-Interest Association Rules from Geo-tagged Photos
HICSS '13 Proceedings of the 2013 46th Hawaii International Conference on System Sciences
Hi-index | 0.00 |
There is an increasing need for a trajectory pattern mining as the volume of available trajectory data grows at an unprecedented rate with the aid of mobile sensing. Region-of-interest mining identifies interesting hot spots that reveal trajectory concentrations. This article introduces an efficient and effective grid-based region-of-interest mining method that is linear to the number of grid cells, and is able to detect arbitrary shapes of regions-of-interest. The proposed algorithm is robust and applicable to continuous and discrete trajectories, and relatively insensitive to parameter values. Experiments show promising results which demonstrate benefits of the proposed algorithm.