Ukusanyaji wa Kikundi kwa Njia ya Spektra (Spectral Clustering)
Ukusanyaji wa Kikundi kwa Njia ya Spektra ni algoriti ya ujifunzaji usiosimamiwa inayotegemea grafu, iliyorasimishwa na Ng, Jordan, na Weiss mnamo 2002, ambayo hupanga pointi za data katika nafasi ya eigenspace yenye vipimo vichache inayotokana na Laplacian ya grafu ya kufanana kabla ya kutumia k-means. Upachikaji huu wa spektra unawezesha kugundua vikundi vya maumbo mbalimbali — pete, hilali, spirali zilizoungana — ambavyo mbinu zinazotegemea umbali wa Euclidean hushindwa kuvitenganisha.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
+5 more
Vyanzo
- 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 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Spectral Clustering via Graph Laplacian Eigenvectors (Ng–Jordan–Weiss Algorithm). ScholarGate. https://scholargate.app/sw/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.
- DBSCANUjifunzaji wa Mashine↔ compare
- Ngeli ya Kiwango cha Juu (Hierarchical Clustering)Ujifunzaji wa Mashine↔ compare
- Uainishaji wa K-meansUjifunzaji wa Mashine↔ compare
- Uchanganuzi wa Vipengele VikuuUjifunzaji wa Mashine↔ compare
- t-SNEUjifunzaji wa Mashine↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →