On-line discovery of hot motion paths
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Discovery of convoys in trajectory databases
Proceedings of the VLDB Endowment
Detecting single file movement
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Time-Aware Similarity Search: A Metric-Temporal Representation for Complex Data
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
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
An entropy-based framework for dynamic clustering and coverage problems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Detecting movement patterns with wireless sensor networks: application to bird behavior
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Pattern-based moving object tracking
Proceedings of the 2011 international workshop on Trajectory data mining and analysis
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Location-Based Social Networks
WSEAS TRANSACTIONS on COMMUNICATIONS
A greener transportation mode: flexible routes discovery from GPS trajectory data
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Tracing Evolving Subspace Clusters in Temporal Climate Data
Data Mining and Knowledge Discovery
Path skyline for moving objects
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Aggregating and disaggregating flexibility objects
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
MOIST: a scalable and parallel moving object indexer with school tracking
Proceedings of the VLDB Endowment
Dynamic k-means: a clustering technique for moving object trajectories
International Journal of Intelligent Information and Database Systems
Adaptive non-parametric identification of dense areas using cell phone records for urban analysis
Engineering Applications of Artificial Intelligence
GeT_move: an efficient and unifying spatio-temporal pattern mining algorithm for moving objects
IDA'12 Proceedings of the 11th international conference on Advances in Intelligent Data Analysis
Exploring pattern-aware travel routes for trajectory search
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Sections on Paraphrasing; Intelligent Systems for Socially Aware Computing; Social Computing, Behavioral-Cultural Modeling, and Prediction
Efficient event detection by exploiting crowds
Proceedings of the 7th ACM international conference on Distributed event-based systems
Sensing group proximity dynamics of firefighting teams using smartphones
Proceedings of the 2013 International Symposium on Wearable Computers
Clustering spatial data streams for targeted alerting in disaster response
Proceedings of the 4th ACM SIGSPATIAL International Workshop on GeoStreaming
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 |
This paper considers the problem of efficiently maintaining a clustering of a dynamic set of data points that move continuously in two-dimensional Euclidean space. This problem has received little attention and introduces new challenges to clustering. The paper proposes a new scheme that is capable of incrementally clustering moving objects. This proposal employs a notion of object dissimilarity that considers object movement across a period of time, and it employs clustering features that can be maintained efficiently in incremental fashion. In the proposed scheme, a quality measure for incremental clusters is used for identifying clusters that are not compact enough after certain insertions and deletions. An extensive experimental study shows that the new scheme performs significantly faster than traditional ones that frequently rebuild clusters. The study also shows that the new scheme is effective in preserving the quality of moving-object clusters.