Professional Documents
Culture Documents
X j = (xj1, . . . , xjN ),
cut(Aj , Aj ) (X j )>LX j
= j = 1, . . . , K,
vol(Aj ) (X j )>DX j
K
X cut(Aj , Aj )
µ(X) = Ncut(A1, . . . , AK ) =
j=1
vol(Aj )
XK
(X j )>LX j
= j > j
.
j=1
(X ) DX
84 CHAPTER 3. GRAPH CLUSTERING
If bj 6= 0, then
2↵j d
aj = bj .
2↵j
(X j )>DX j = ↵j a2j .
3.3. K-WAY CLUSTERING USING NORMALIZED CUTS 85
is shown below:
0 1
0 a2 0 0
Ba 1 0 0 0C
B C
B0 0 a3 0C
B C
Ba 1 0 0 0C
B C
B0 a2 0 0C
X=B
Ba 1
C.
B 0 0 0CC
B0 0 0 a4C
B C
B0 0 a3 0C
B C
@0 0 0 a4A
0 0 a3 0
(X i)>X j = 0, 1 i, j K, i 6= j. (⇤)
3.3. K-WAY CLUSTERING USING NORMALIZED CUTS 87
(X i)>X j = 0
is equivalent to
(X i)>DX j = 0. (⇤⇤)
88 CHAPTER 3. GRAPH CLUSTERING
det(X >X) 6= 0.
but
0 1
n1a1
X >1N = @ .. A ,
nK aK
90 CHAPTER 3. GRAPH CLUSTERING
and thus
X(X >X) 1X >1N = 1N . (†)
XX +1N = 1N .
3.3. K-WAY CLUSTERING USING NORMALIZED CUTS 91
If we let
n
X = [X 1 . . . X K ] | X j = aj (xj1, . . . , xjN ), xji 2 {1, 0},
o
j
aj 2 R, X 6= 0
XK
(X j )>LX j
minimize j )> DX j
j=1
(X
subject to (X i)>DX j = 0, 1 i, j K, i 6= j,
X(X >X) 1X >1 = 1,
X 2 X.
Remark:
Because
(X j )>LX j = (X j )>DX j (X j )>W X j
= vol(Aj ) (X j )>W X j ,
Instead of minimizing
XK j > j
(X ) LX
µ(X 1, . . . , X K ) = j )> DX j
,
j=1
(X
we can maximize
K
X (X j )>W X j
✏(X 1, . . . , X K ) = ,
j=1
(X j )>DX j
since
✏(X 1, . . . , X K ) = K µ(X 1, . . . , X K ).
96 CHAPTER 3. GRAPH CLUSTERING
X >DX = I,
1/2 1/2
so we use the normalized Laplacian Lsym = D LD
instead of L,
X >DX = Y >Y = I,
and conditions (2), (3), (4) are preserved under the change
of variable Y = D1/2X, since D1/2 is invertible.
Problem (⇤2)
Problem (⇤1)
XK
(X j )>LX j
minimize j )> DX j
j=1
(X
subject to (X i)>DX j = 0, X j 6= 0 1 i, j K, i 6= j,
X(X >X) 1X >1 = 1.
Y Y +D1/21 = D1/21.
Y + = Y >,
Problem (⇤⇤2)
0 = ⌫1 ⌫2 . . . ⌫K
of Lsym.
Y Y >D1/21 = D1/21
(Z i)>DZ j = 0, whenever i 6= j.
Z >Z = R⌃R>,