z-logo
Premium
Spatial detection of anomalous cellular network events
Author(s) -
Loh Ji Meng
Publication year - 2014
Publication title -
statistical analysis and data mining: the asa data science journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.381
H-Index - 33
eISSN - 1932-1872
pISSN - 1932-1864
DOI - 10.1002/sam.11229
Subject(s) - scan statistic , statistic , computer science , anomaly detection , data mining , algorithm , focus (optics) , extreme value theory , pattern recognition (psychology) , mathematics , statistics , artificial intelligence , physics , optics
Identifying anomalous cellular network events is important for network management. Timely identification can aid mitigation and help improve customer satisfaction. The data considered in this work is a space‐time point process where the points are reports sent in by customers in response to unsuccessful cellular activity such as dropped calls. Our focus is on identifying, for each time period, clusters of such reports that represent unusually high volume relative to similar data in past time periods. This spatial anomaly detection is done using modifications of the K ‐scan method developed by Loh. The K ‐scan method uses a K i statistic to identify candidate points for anomalous clusters. These K i values are related to the inhomogeneous K function of the point pattern. We implemented a p ‐value approximation based on an extreme value distribution to replace bootstrap to assess significance. This improves the speed of the algorithm. We also use an FDR approach to account for multiplicity in time. This FDR approach was also used to implement a multi‐scale version of K ‐scan, where multiple distance values are used in the K i statistic. Finally, we investigated using an ellipse instead of a circle to define the K i statistic used in K ‐scan, comparing the two methods with a simulation study. Results from applying K ‐scan to the data are also presented.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here