Escolar Documentos
Profissional Documentos
Cultura Documentos
Some Slides
Jean Gallier
Department of Computer and Information Science
University of Pennsylvania
Philadelphia, PA 19104, USA
e-mail: jean@cis.upenn.edu
c Jean Gallier
May 7, 2015
2
Contents
3 Graph Clustering 55
3.1 Graph Clustering Using Normalized Cuts . 55
3.2 Special Case: 2-Way Clustering Using Nor-
malized Cuts . . . . . . . . . . . . . . . . 60
3.3 K-Way Clustering Using Normalized Cuts 79
3.4 Discrete Solution Close to a Continuous
Approximation . . . . . . . . . . . . . . . 116
Bibliography 217
Chapter 1
5
6 CHAPTER 1. GRAPHS AND GRAPH LAPLACIANS
e1
v1 v2
e5
e2 e3 e4 v5
e6
v3 v4
e7
a
v1 v2
e
b c d v5
f
v3 v4
g
15
Note that in the above sum, only nodes vj such that there
is an edge {vi, vj } have a nonzero contribution. Such
nodes are said to be adjacent to vi, and we write vi ⇠ vj .
Volume of a set
Degree of a node: vol(A) = di
i A
di = j Wi,j
Degree matrix:
Dii = j Wi,j
18
19
The quantity
cut(A) = links(A, A)
is often called the cut of A, and the quantity
assoc(A) = links(A, A)
is often called the association of A. Clearly,
cut(A) + assoc(A) = vol(A).
Weight of a cut:
cut(A,B) = i A, j B Wi,j
20
Figure 1.5: A Cut involving the set of nodes in the center and the nodes on the perimeter.
Lrw = D 1L = I D 1W.
This follows easily from the fact that Proposition 1.1 ap-
plies to the underlying graph of a weighted graph. The
proof is left as an exercise.