CLARANS: A Method for Clustering Objects for Spatial Data Mining
IEEE Transactions on Knowledge and Data Engineering
STING: A Statistical Information Grid Approach to Spatial Data Mining
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Rapid detection of significant spatial clusters
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
The hunting of the bump: on maximizing statistical discrepancy
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Spatial scan statistics: approximations and performance study
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
A Model-Agnostic Framework for Fast Spatial Anomaly Detection
ACM Transactions on Knowledge Discovery from Data (TKDD)
Regional behavior change detection via local spatial scan
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Top-Eye: top-k evolving trajectory outlier detection
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Parameter-free anomaly detection for categorical data
MLDM'11 Proceedings of the 7th international conference on Machine learning and data mining in pattern recognition
On mining anomalous patterns in road traffic streams
ADMA'11 Proceedings of the 7th international conference on Advanced Data Mining and Applications - Volume Part II
On detection of emerging anomalous traffic patterns using GPS data
Data & Knowledge Engineering
Hi-index | 0.00 |
Given a spatial data set placed on an n x n grid, our goal is to find the rectangular regions within which subsets of the data set exhibit anomalous behavior. We develop algorithms that, given any user-supplied arbitrary likelihood function, conduct a likelihood ratio hypothesis test (LRT) over each rectangular region in the grid, rank all of the rectangles based on the computed LRT statistics, and return the top few most interesting rectangles. To speed this process, we develop methods to prune rectangles without computing their associated LRT statistics.