Spektral klyngedannelse
Spektral klyngedannelse er en graf-baseret unsupervised læringsalgoritme, formaliseret af Ng, Jordan og Weiss i 2002, der afbilder datapunkter ind i et lav-dimensionelt egenrum udledt fra ligationsgrafens Laplacematrix, før k-means anvendes. Denne spektrale indlejring gør det muligt at genfinde klynger af arbitrær form – ringe, halvmåner, indflettede spiraler – som euklidiske afstandsbaserede metoder konsekvent undlader at adskille.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
+5 more
Kilder
- Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems, 14, 849–856. link ↗
- von Luxburg, U. (2007). A Tutorial on Spectral Clustering. Statistics and Computing, 17, 395–416. DOI: 10.1007/s11222-007-9033-z ↗
- Shi, J., & Malik, J. (2000). Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888–905. DOI: 10.1109/34.868688 ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Spectral Clustering via Graph Laplacian Eigenvectors (Ng–Jordan–Weiss Algorithm). ScholarGate. https://scholargate.app/da/machine-learning/spectral-clustering
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- DBSCANMaskinlæring↔ compare
- Hierarkisk grupperingMaskinlæring↔ compare
- K-means ClusteringMaskinlæring↔ compare
- Principal Component AnalysisMaskinlæring↔ compare
- t-SNEMaskinlæring↔ compare
Refereret af
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →