Documente Academic
Documente Profesional
Documente Cultură
GRAPH CLUSTERING
'(X, Q) = kX ZQkF .
3.4. DISCRETE SOLUTION CLOSE TO A CONTINUOUS APPROXIMATION 119
we have
0 1
✓ ◆ 1 0 ✓ ◆
1 1 1 @ 2 1
Z >X = 0 1A = ,
1 0 1 0 0
1 0
b of X, which is
To find X 2 K, first we find the shape X
the matrix obtained from X by rescaling the columns of
X so that Xb has entries +1, 0.
Since
If we let
µi = max yij
1jK
Ji = {j 2 {1, . . . , K} | yij = µi},
for i = 1, . . . , N , then
(
+1 for some chosen j 2 Ji,
xij =
0 otherwise.
Figure 3.5 shows a graph (on the left) and the graph
drawings X and Z ⇤ R obtained by applying our method
for three clusters.
40
30
3 20
Z
10
2.5
0
-10
2
-20
1.5 -20
0
0
1 20
Y 20
40 40
1 1.5 2 2.5 3 X
c = c + abs(ZRk 1).
kZ 1N k22 ,
K
X
zij2 2j ,
j=1
2 2
Z Z 1N 2
,
2
= (Z Z)+1N .
1/2 1/2
N Z = diag((ZZ >)11 , . . . , (ZZ >)N N ),
and we return N Z ⇤ Z.
3 3 3
3
2 2 2 2
1 1 1 1
Figure 3.7: Four blocks of a normalized cut for the graph associated with W1 .
3.4. DISCRETE SOLUTION CLOSE TO A CONTINUOUS APPROXIMATION 151
During the next round, the exact same matrices are ob-
tained and the algorithm stops.
3.4. DISCRETE SOLUTION CLOSE TO A CONTINUOUS APPROXIMATION 155
3 3 3
3 3
2 2 2 2 2
1 1 1 1
1
Figure 3.8: Five blocks of a normalized cut for the graph associated with W1 .
156 CHAPTER 3. GRAPH CLUSTERING