Graph based Clustering Algorithm for Social Community Transmission Prediction of COVID-19
Varun Nagesh Jolly Behera, Ashish Ranjan, Motahar Reza

TL;DR
This paper presents a graph clustering algorithm to predict potential COVID-19 hotspots based on geographic proximity and active case data, aiding targeted preventive measures.
Contribution
It introduces a novel graph-based method focusing on geographical and transmission factors to predict future hotspots for COVID-19.
Findings
Effective identification of potential hotspots based on proximity and case data
Enables targeted preventive measures reducing overall restrictions
Provides a framework adaptable to different regional data sets
Abstract
A system to model the spread of COVID-19 cases after lockdown has been proposed, to define new preventive measures based on hotspots, using the graph clustering algorithm. This method allows for more lenient measures in areas less prone to the virus spread. There exist methods to model the spread of the virus, by predicting the number of confirmed cases. But the proposed system focuses more on the preventive side of the solution from a geographical point of view, by predicting the areas or regions that may become hotspots for the virus in the near future. The fact that the virus can only be transmitted by being in close proximity to an already infected person, suggests that, the regions that can easily be reached from an existing hotspot, have a higher chance of becoming a new hotspot. Moreover, in smaller regions, even after strict provisions, positive cases have been found. To…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCOVID-19 epidemiological studies · Data-Driven Disease Surveillance · SARS-CoV-2 detection and testing
