Skip to main content

Table 3 The time complexity of algorithm

From: A novel density-based clustering method for effective removal of spurious intersections in bearings-only localization

Algorithm

Time complexity

Minimum K distance

\(\textrm{O}\left[ N S(N S-1) N T^2\right]\)

M-DBSCAN

\(\textrm{O}\left( K^* N S^* N T^* {\text {Min}}_{p t s}\right)\)

DBSCAN

\(\textrm{O}\left( \frac{N S(N S-1)}{2} N T^2 {\text {Min}}_{p t s}\right)\)

FCM

\(\textrm{O}\left( \frac{N S(N S-1)}{2} N T^3 NI\right)\)