Given the spectral graph clustering optimization problem Find y that minimizes y Ly yy=n and 1¹y = 0, which of the following optimization problems produce a vector y that leads to the same sweep cut as the optimization problem above? M is a diagonal mass matrix with different masses on the diagonal. Minimize y™ Ly A: subject to and Minimize y O B: subject to and y¹y = 1 1¹y = 0 subject to Ly Vi, yi= 1 or y; = -1 1¹y = 0 C: Minimize y¹ Ly/(yy) subject to 1¹y = 0 Minimize y™ Ly OD: subject to and y My = 1 1TMy = 0
Given the spectral graph clustering optimization problem Find y that minimizes y Ly yy=n and 1¹y = 0, which of the following optimization problems produce a vector y that leads to the same sweep cut as the optimization problem above? M is a diagonal mass matrix with different masses on the diagonal. Minimize y™ Ly A: subject to and Minimize y O B: subject to and y¹y = 1 1¹y = 0 subject to Ly Vi, yi= 1 or y; = -1 1¹y = 0 C: Minimize y¹ Ly/(yy) subject to 1¹y = 0 Minimize y™ Ly OD: subject to and y My = 1 1TMy = 0
Related questions
Question
Transcribed Image Text:Given the spectral graph clustering optimization problem
Find y that minimizes y Ly
subject to
and
y¹y = n
1¹y = 0,
which of the following optimization problems produce a vector y that leads to the same sweep cut as the optimization
problem above? M is a diagonal mass matrix with different masses on the diagonal.
Minimize y™ Ly
A: subject to
and
Minimize y
O B: subject to
and
y¹y = 1
1¹y = 0
Ly
Vi, y₁ = 1 or y¡ = -1
1¹y = 0
Minimize y¹ Ly/(yy)
subject to
1¹y = 0
Minimize y¹ Ly
OD: subject to
and
y My = 1
1¹ My = 0
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 39 images
