Spectral clustering: Difference between revisions

Revision as of 21:30, 7 March 2022

Revision as of 21:50, 7 March 2022

Line 115:

=== Relationship to DBSCAN ===

In the trivial case of determining [[Connected component (graph theory)|connected graph components]] — the optimal clusters with no edges cut — spectral clustering is also related to a spectral version of [[DBSCAN]] clustering, that finds density-connected components.<ref>{{Cite conference|last1=Schubert|first1=Erich|last2=Hess|first2=Sibylle|last3=Morik|first3=Katharina|date=2018|title=The Relationship of DBSCAN to Matrix Factorization and Spectral Clustering|url=http://ceur-ws.org/Vol-2191/paper38.pdf|conference=LWDA|pages=330–334}}</ref>

== Measures to compare clusterings ==