# Eigenspace method for spatiotemporal hotspot detection

@article{FanaeeT2015EigenspaceMF,
title={Eigenspace method for spatiotemporal hotspot detection},
journal={ArXiv},
year={2015},
volume={abs/1406.3506}
}
• Published 2015
• Computer Science, Mathematics
• ArXiv
Hotspot detection aims at identifying sub-groups in the observations that are unexpected, with respect to some baseline information. For instance, in disease surveillance, the purpose is to detect sub-regions in spatiotemporal space, where the count of reported diseases e.g. cancer is higher than expected, with respect to the population. The state-of-the-art method for this kind of problem is the space-time scan statistics, which exhaustively search the whole space through a sliding window… Expand

#### Figures, Tables, and Topics from this paper

An Eigenspace approach for detecting multiple space-time disease clusters: Application to measles hotspots detection in Khyber-Pakhtunkhwa, Pakistan
• Computer Science, Medicine
• PloS one
• 2018
An extension of the EigenSpot algorithm is proposed that is able to handle multiple hotspots by iteratively removing previously detected hotspots and re-running the algorithm until no more hotspots are found, and the effectiveness of the proposed method for detecting multiple clusters in a spatiotemporal space is shown. Expand
Detecting space-time disease clusters with arbitrary shapes and sizes using a co-clustering approach.
• Computer Science, Medicine
• Geospatial health
• 2017
A new algorithm is proposed, which uses a co-clustering strategy to detect prospective and retrospective space-time disease clusters with no restriction on shape and size and was utilised to detect potential clusters in the annual and monthly malaria data in Khyber Pakhtunkhwa Province, Pakistan from 2012 to 2016. Expand
Detecting hotspots of urban residents’ behaviours based on spatio-temporal clustering techniques
• Computer Science
• 2017
The proposed approach to detect the spatio-temporal hotspots of urban residents’ behaviours is effective and useful and validated based on the GPS data of floating cars of a city in southern China. Expand
Data-Driven Approaches for Spatio-Temporal Analysis: A Survey of the State-of-the-Arts
• Computer Science
• Journal of Computer Science and Technology
• 2020
This survey provides a structured and systematic overview of the research on data-driven approaches for spatio-temporal data analysis, and provides a comprehensive coverage of the techniques from both computational/methodological and application perspectives. Expand
Spatiotemporal extended fuzzy C-means clustering algorithm for hotspots detection and prediction
• Computer Science, Mathematics
• Fuzzy Sets Syst.
• 2018
A spatiotemporal clustering method, namely SEFCM, which is a generalization of the extended fuzzy C-Means (EFCM) method for detecting hotspots in spatial analysis and prediction of the hotspots obtained in a given year is presented. Expand
Clustering of Information Granules in Hotspot Identification
• Computer Science
• 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)
• 2019
This study proposes an aggregation of Fuzzy C-Means algorithm and the principle of justifiable granularity (PJG) as a new approach to forming hotspots and presents a weighted granular clustering method to further abstract the constructed hotspots. Expand
Combinatorial Optimization Algorithms to Mine a Sub-Matrix of Maximal Sum
• Computer Science
• NFMCP@PKDD/ECML
• 2017
This work exhibits some key properties of this $$\mathcal {NP}$$-hard problem and defines a bounding function such that larger problems can be solved in reasonable time and results in an improved CP-LNS implementation evaluated here. Expand
New Frontiers in Mining Complex Patterns
• Yuzuru Tanaka
• Computer Science
• Lecture Notes in Computer Science
• 2017
It is shown that a simple model can learn the factor metric quite efficiently from a vast amount of data that is available in many online review systems and clarified that there is no universal solution and the influential factor depends on each dataset. Expand
New irreversibility measure and complexity analysis based on singular value decomposition
• Mathematics
• 2018
Visibility graph algorithm is a powerful tool for visualization and analysis of complex dynamical system. Kullback–Leibler divergence(KLD), based on the horizontal visibility graph algorithm, hasExpand
Recurrence quantity analysis based on singular value decomposition
• Mathematics, Computer Science
• Commun. Nonlinear Sci. Numer. Simul.
• 2017
This paper will study the RP based on singular value decomposition which is a new perspective of RP study and Principal singular value proportion (PSVP) will be proposed as one new RQA measure and bigger PSVP means higher complexity for one system and smaller PSVP reflects a regular and stable system. Expand

#### References

SHOWING 1-10 OF 42 REFERENCES
An Early Warning System for Space-Time Cluster Detection
• Mathematics, Computer Science
• GeoInfo
• 2003
A statistical method to test for the presence of space-time clusters in point processes data, when the goal is to identify and evaluate the statistical significance of localized clusters is proposed. Expand
A flexibly shaped spatial scan statistic for detecting clusters
• Medicine
• International journal of health geographics
• 2005
A flexibly shaped spatial scan statistic that can detect irregular shaped clusters within relatively small neighborhoods of each region and has good usual powers plus the ability to detect the noncircular hot-spot clusters more accurately than the circular one. Expand
Detection of spatial and spatio-temporal clusters
• Computer Science
• 2006
A general and powerful statistical framework for the automatic detection of spatial and space-time clusters, currently used in daily practice by several state and local health departments, and can detect outbreaks significantly faster than previous disease surveillance methods. Expand
Rapid detection of significant spatial clusters
• Computer Science, Mathematics
• KDD
• 2004
A multiresolution algorithm is presented which partitions the grid into overlapping regions using a novel overlap-kd tree data structure, bounds the maximum score of subregions contained in each region, and prunes regions which cannot contain the maximum density region. Expand
Spatial scan statistics: approximations and performance study
• Mathematics, Computer Science
• KDD '06
• 2006
A simple exact algorithm for finding the largest discrepancy region in a domain and a new approximation algorithm for a large class of discrepancy functions (including the Kulldorff scan statistic) that improves the approximation versus run time trade-off of prior methods are described. Expand
A Robust Expectation-Based Spatial Scan Statistic
• Computer Science
• 2007
A new expectation-based scan statistic that is robust to outliers (individual anomalies at the store level that are not indicative of outbreaks) is described, and it is demonstrated that the robust statistic improves timeliness and specificity of outbreak detection. Expand
A multivariate Bayesian scan statistic for early event detection and characterization
• Computer Science
• Machine Learning
• 2009
MBSS can model and differentiate between multiple event types, thus distinguishing between events requiring urgent responses and other, less relevant patterns in the data, and allows faster and more accurate event detection by integrating information from the multiple streams. Expand
Spatial disease clusters: detection and inference.
• Medicine, Computer Science
• Statistics in medicine
• 1995
The proposed test can detect clusters of any size, located anywhere in the study region, and is not restricted to clusters that conform to predefined administrative or political borders. Expand
A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters
• Mathematics, Computer Science
• Comput. Stat. Data Anal.
• 2004
A new graph-based strategy for the detection of spatial clusters of arbitrary geometric form in a map of geo-referenced populations and cases, based on the likelihood ratio test previously formulated by Kulldorff and Nagarwalla for circular clusters is proposed. Expand
What's Strange About Recent Events (WSARE): An Algorithm for the Early Detection of Disease Outbreaks
• Mathematics, Computer Science
• J. Mach. Learn. Res.
• 2005
An early disease outbreak detection algorithm called What's Strange About Recent Events (WSARE), which uses a multivariate approach to improve its timeliness of detection and incorporates a wide range of ideas, including association rules, Bayesian networks, hypothesis testing and permutation tests. Expand