Graph-Based Hotspot Detection of Socio-Economic Data Using Rough-Set

The term hotspot refers to a location or an area where the occurrence of a particular phenomenon, event, or activity is significantly higher than in the surrounding areas. The existing statistical methods need help working well on discrete data. Also, it can identify a false hotspot. This paper proposes a novel graph-based hotspot detection using a rough set (GBHSDRS) for detecting the hotspots. This algorithm works well with discrete spatial vector data. Furthermore, it removes the false hotspot by finding the statistical significance of the identified hotspots. A rough set theory is applied to the graph of the spatial polygon data, and the nodes are divided into lower, boundary, and negative regions. Therefore, the candidate hotspot belongs to the lower region of the set, and the boundary value analysis will ensure the identification of the hotspots if the hotspot is present in the dataset. The p -value is used to find the statistical significance of the hotspots. The algorithm is tested on the socioeconomic data of Uttar Pradesh (UP) from 1991 on medical facilities. The average gain in density and Hotspot Prediction Accuracy Index (HAPI) of the detected hotspots is 26.54% and 23.41%, respectively. An average reduction in runtime is 27.73%, acquired compared to all other methods on the socioeconomic data.