K-means Nusu-Simamiwa
K-means Nusu-Simamiwa hupanua uwekaji makundi wa K-means wa kawaida kwa kujumuisha usimamizi wa sehemu — aidha seti ndogo ya pointi za mbegu zenye lebo au vizuizi vya jozi vya lazima-kuunganisha na haviwezi-kuunganisha — ili kuongoza uundaji wa makundi. Inajenga daraja kati ya uwekaji makundi usiosimamiwa na uainishaji uliosimamiwa kikamilifu, kuwezesha makundi yenye maana zaidi wakati lebo ni chache lakini ni ghali kuzipata kikamilifu.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Wagstaff, K., Cardie, C., Rogers, S., & Schroedl, S. (2001). Constrained K-means Clustering with Background Knowledge. In Proceedings of the 18th International Conference on Machine Learning (ICML 2001), pp. 577–584. link ↗
- Basu, S., Banerjee, A., & Mooney, R. J. (2002). Semi-supervised Clustering by Seeding. In Proceedings of the 19th International Conference on Machine Learning (ICML 2002), pp. 27–34. link ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Semi-supervised K-means Clustering. ScholarGate. https://scholargate.app/sw/machine-learning/semi-supervised-k-means
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.
- Kujifunza kwa Njia AmilifuUjifunzaji wa Mashine↔ compare
- DBSCANUjifunzaji wa Mashine↔ compare
- Uainishaji wa K-meansUjifunzaji wa Mashine↔ compare
- Ujifunzaji Nusu-SimamiwaUjifunzaji wa Mashine↔ compare
- Ukusanyaji wa Kikundi kwa Njia ya Spektra (Spectral Clustering)Ujifunzaji wa Mashine↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →