0.25
0.5
0.75
1.25
1.5
1.75
2
Convex transduction with the normalized cut
Published on Feb 25, 20073475 Views
We discuss approaches to transduction based on graph cut cost functions. More specifically, we focus on the normalized cut, which is the cost function of choice in many clustering applications, notabl
Related categories
Chapter list
Convex transduction with the Normalized Cut00:02
Motivation01:01
Motivation01:32
Motivation02:29
Overview03:23
The Normalized Cut for Clustering04:06
The Normalized Cut for Clustering05:22
The Normalized Cut for Clustering05:39
The Normalized Cut for Clustering06:13
The Normalized Cut for Clustering06:30
The Normalized Cut for Clustering06:59
The Normalized Cut for Clustering07:25
Overview07:55
A spectral relaxation08:02
A spectral relaxation08:24
A spectral relaxation09:31
Overview09:50
An SDP relaxation09:54
An SDP relaxation10:48
An SDP relaxation11:36
An SDP relaxation11:59
Overview12:33
Transduction based on the Normalized Cut12:44
Transduction based on the Normalized Cut12:56
Transduction based on the Normalized Cut13:31
Transduction based on the Normalized Cut13:51
Transduction based on the Normalized Cut14:30
Overview14:55
A combined approach15:16
A combined approach15:38
A combined approach16:25
A combined approach16:45
A combined approach17:37
A combined approach17:48
Overview18:26
Experiments & conclusions18:29
Experiments & conclusions19:45
Experiments & conclusions20:23
Experiments & conclusions20:40
Experiments & conclusions21:50
Experiments & conclusions22:08
Experiments & conclusions23:00