Ikibazo gihuza ibibazo · Hagati Urwego

K-Bisobanura Ikibazo

Witoze K-Bisobanura umukoro, kuvugurura centroid, inertia, gutangiza, hamwe nimbibi zifatika hamwe ningero zifatika zo guteranya.

Inzira zijyanye no kuyoboraK Bisobanura Gukusanya
Ikibazo 1 Bya 8

'K' muri K-Bisobanura iki?

Reba buri kibazo8 ibibazo

Ibisubizo nibisobanuro bigaragara mugihe ufata ikibazo.

  1. 'K' muri K-Bisobanura iki?
    • Umubare w'amatsinda wahisemo mbere
    • Umubare w'amanota
    • Umubare w'amahugurwa asubiramo
    • Umubare wibiranga muri dataset
  2. Ni izihe ntambwe ebyiri zisubiramo muri K-Means loop?
    • Gutandukanya amatsinda, hanyuma uhuze cluster
    • Shyira amanota kuri centroid hafi, hanyuma wimure centroide hagati
    • Ikirango amakuru, hanyuma uhugure urutonde
    • Shungura amakuru, hanyuma ukure hanze
  3. Ni kangahe K-Igerageza kugerageza kugabanya?
    • Umubare w'amatsinda
    • Intera iri hagati ya centroide
    • Imbere-cluster iringaniye (inertia)
    • Umubare wibiranga
  4. Kuki K-Igisobanuro cyitwa algorithm 'idakurikiranwa'?
    • It uses predefined class labels to learn a boundary
    • It requires one label per initial centroid
    • It estimates labels only after supervised training
    • It groups inputs without target class labels
  5. Ni ubuhe buryo 'inkokora' bukoreshwa cyane?
    • Kwihutisha amahugurwa
    • Guhitamo agaciro keza ka K.
    • Gutangiza centroide
    • Gukuraho ingingo zibiri
  6. Kuki K-Igisobanuro gishobora gutanga ibisubizo bitandukanye kumikorere itandukanye?
    • K automatically changes on every run
    • Euclidean distance uses a random definition
    • Results depend on initial centroid positions
    • Convergence always produces the same global optimum
  7. A K-Means cluster contains the one-dimensional values 2, 4, and 9. Where does its centroid move in the update step?
    • 5, the mean of the assigned values
    • 4, the middle observed value
    • 9, the largest assigned value
    • 15, the sum of the assigned values
  8. A dataset contains two long, curved groups. Which K-Means limitation should the analyst consider?
    • The groups must have labels before clustering
    • K-Means always discovers curved boundaries exactly
    • Changing K guarantees the intended grouping
    • Euclidean distance to centroids can poorly represent elongated or non-spherical groups