An Efficient Target-to-Area Classification Strategy with a PIP-Based KNN Algorithm for Epidemic Management
Jong-Shin Chen, Ruo-Wei Hung, Cheng‐Ying Yang · Mathematics · 2025
During a widespread epidemic, a large portion of the population faces an increased risk of contracting infectious diseases such as COVID-19, monkeypox, and pneumonia. These outbreaks often trigger cascading effects, significantly impacting society and healthcare systems. To contain the spread, the Centers for Disease Control and Prevention (CDC) must monitor infected individuals (targets) and their geographical locations (areas) as a basis for allocating medical resources. This scenario is a Target-to-Area (TTA) problem. Previous research introduced the Point-In-Polygon (PIP) technique to address multi-target and single-area TTA problems. PIP technology relies on an area’s boundary points to determine whether a target is within that region. However, when dealing with multi-target, multi-area TTA problems, PIP alone may have limitations. The K-Nearest Neighbors (KNN) algorithm presents a promising alternative, but its classification accuracy depends on the availability of sufficient samples, i.e., known targets and their corresponding geographical areas. When sample data are limited, the effectiveness of KNN is constrained, potentially delaying the CDC’s ability to track and manage outbreaks. For this problem, this study proposes an improved approach that integrates PIP and KNN technologies while introducing area boundary points as additional samples. This enhancement aims to improve classification accuracy and mitigate the impact of insufficient sample data on epidemic tracking and management.