For large scale data, there is no current existing approach is optimal. DBSCAN requires O(n2) time, Fast-DBSCAN only works well in 2 dimensions, and Ļ-Approximate DBSCAN runs in O(n) expected time which needs dimension D to be a relative small constant for the linear running time to hold. If someone averagely runs in O(n*log(n)) with the help of indexing technique, it is also well.
from reference:[]
Top comments (0)