CSE575_KnowledgeCheck_GraphCutFormulation

pdf

School

Arizona State University *

*We aren’t endorsed by this school

Course

575

Subject

Computer Science

Date

Feb 20, 2024

Type

pdf

Pages

1

Uploaded by MagistrateElectronJellyfish43

Report
CSE 575 - Knowledge Check: Graph Cut Formulation #1 | 00:05 | 1/1 point If the dataset has only pair-wise similarity, and we want to cluster on it, which approach should we choose? O swMm O K-means ® MinCut I Correct #2 | 00:05 | 1/1 point In MinCut algorithm, we only need to consider the CutSize. True I Correct O False #3 | 00:05 | 1/1 point To obtain 2-way partition, we should pick the eigenvector that is corresponding to which eigenvalue? (O The smallest (O The largest The second smallest I Correct (O The second largest 5}
Discover more documents: Sign up today!
Unlock a world of knowledge! Explore tailored content for a richer learning experience. Here's what you'll get:
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help