6th IARP -TC-15 Workshop on Graphbased Representations in Pattern Recognition

Szemerédi's Regularity Lemma and PairwiseClustering

author: Marcello Pelillo, University Ca Foscari

Categories

Top: Computer Science: Machine Learning: Clustering

You might be experiencing some problems with Your Video player.

*Slides*
0:00	Szemer´edi’s Regularity Lemma and Pairwise Clustering
1:48	Talk’s Outline
2:51	Talk’s Outline (2)
2:52	Edge Density
3:59	Regularity
5:28	Equitable Partitions
7:18	Szemer´edi’s Lemma
9:19	Talk’s Outline
9:53	Algorithmic Issues
10:55	Checking Regularity
11:45	Index of Partition
12:37	Refining a Non-regular Partition
14:24	Alon et al.s Algorithm: Initialization
15:09	Alon et al.’s Algorithm: Main Loop
16:40	Talk’s Outline
16:41	Reduced Graphs
18:57	Expanded Graphs
20:00	The Key Lemma
22:04	Using the Key Lemma
23:06	Using Weighted Graphs
23:09	Application to Pairwise Clustering
24:27	Using Weighted Graphs
25:40	Dealing with Intra-class Similarities
26:44	Talk’s Outline
26:46	Implementation Details
28:48	Experiments on UCI Datasets
29:15	Results on UCI Datasets
31:26	Image Segmentation
31:55	Image Segmentation (2)
32:29	Segmentation Results
33:20	Conclusions
33:52	Future Work

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.