Table 3 summarizes the computational time required for seeds initialization and K-Means iterations until convergence. Because R-SEL and RMEANS do not have a sequential deterministic procedure, they were completed almost instantly.
However, they usually required additional iterations to converge. KR, on the other hand, took the longest time to select initial seeds despite its rapid convergence. When the number of instances exceeded 2,000, it even took hundreds of
seconds. The computational cost of CSI was comparable to SCS, KKZ, CCIA, and kd-tree. CSI, however, generally converged faster than them, as we anticipated.