arXiv cs.NE
· Papers
The K-SCAN Clustering Algorithm
arXiv:2607.24537v1 Announce Type: cross Abstract: In the Big Data era, the scalability of clustering algorithms constitutes a key challenge. Traditional density-based methods (e.g., DBSCAN) offer robustness to noise and the ability to detect non-linear clusters, yet their quadratic time complexity $O(N^2)$ drastically