sentences:  Spectral clustering is also related to DBSCAN clustering, that finds density-connected components.Connected components correspond to optimal spectral clusters (no edges cut); and DBSCAN uses an asymmetric neighbor graph with edges removed when source points are not dense.Thus, DBSCAN is a special case of spectral clustering, but one which allows more efficient algorithms (worst case formula_38, in many practical cases much faster with indices).