Documente Academic
Documente Profesional
Documente Cultură
Graph Clustering
55
56 CHAPTER 3. GRAPH CLUSTERING
15 16
Figure 3.1: A weighted graph and its partition into two clusters.
K
X K
X
links(Ai, Ai) cut(Ai, Ai)
Ncut(A1, . . . , AK ) = = .
i=1
vol(Ai) i=1
vol(Ai)
X >LX
.
X >DX
X = (x1, . . . , xN ),
We obtain
d
Ncut(A, A) = cut(A, A)
↵(d ↵)
and
X >LX (a b)2
= cut(A, A).
X >DX ↵a2 + (d ↵)b2
In order to have
X >LX
Ncut(A, A) = > ,
X DX
(a b)2 d
2 2
= .
↵a + (d ↵)b ↵(d ↵)
64 CHAPTER 3. GRAPH CLUSTERING
a↵ + b(d ↵) = 0. (†)
with
↵
k= .
d
Belkin and Niyogi [2] use
1 1
a= , b= .
↵ d ↵
So, let
K = X 2 X | X >D1 = 0 ,
Problem PNC1
X >LX
minimize
X >DX
subject to X >D1 = 0, X 2 X.
Problem PNC2
minimize X >LX
subject to X >DX = 1, X >D1 = 0, X 2 X.
minimize X >LX
subject to X >DX = 1, X >D1 = 0.
70 CHAPTER 3. GRAPH CLUSTERING
Figure 3.2: Underlying graph of the matrix W1 (left); normalized cut (middle); blocks of the
cut (right).
3.2. SPECIAL CASE: 2-WAY CLUSTERING USING NORMALIZED CUTS 75
Figure 3.3: Underlying graph of the matrix W2 (left); normalized cut (middle); blocks of the
cut (right).
Figure 3.4: Underlying graph of the matrix W3 (left); normalized cut (middle); blocks of the
cut (right).